Index
asteroidal triple of edges
asteroidal triple of vertices
bigraph
B(G)
,
B(D)
of a graph or digraph
Betti number
box graphs
chordal graphs
chromatic number
circle graph
circular-arc graph (topology of)
clique graphs
clique number
clique multigraph
cocomparability graph
competition graphs
Computing the intersection graph from the model
Computing the model from the intersection graph
conformal hypergraph
consecutive-ones property
dual hypergraph
H*
dualization approach for reconstruction
facet graph
forbidden induced subgraphs
G(P)
,
G
0
(P)
H°
H[t]
Helly property
induced minor
intersection bigraph
intersection class
intersection digraph
intersection h-graphs
intersection multigraph
intersection number
interval bigraph
interval digraph
interval graph
Krausz-type characterization
Leray property
line bigraph
line digraph
line graph
k
-line graph
linear (uniform) hypergraph
minor
octahedron graphs
O
t
perfect graph
permutation graph
powers of graphs
proper interval bigraph
random graph
recognition problem
reconstruction problem
reduct
R(G)
row-intersection graph of a matrix
Scheinerman classes
self-dual hypergraphs
simplicial complex
G^
of a graph
square of a graph
star graphs for intersection graphs
star graphs for intersection bigraphs
star graphs for
t
-intersection graphs
2-step graph of a graph
t
-intersection
t
-set hypergraph
H[t]
tolerance intersection
trapezoid graph
tree-width
underlying graph
unit-disk graph
Erich Prisner
made on January 12, 1999