Forbidden graph characterization
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to the family. A prototypical example of this phenomenon is Kuratowski's theorem, which states that a graph is planar (can be drawn without crossings in the plane) if and only if it does not contain either of two forbidden graphs, the complete graph K_{5} and the complete bipartite graph K_{3,3}. For Kuratowski's theorem, the notion of containment is that of graph homeomorphism, in which a subdivision of one graph appears as a subgraph of the other. Thus, every graph either has a planar drawing (in which case it belongs to the family of planar graphs) or it has a subdivision of one of these two graphs as a subgraph (in which case it does not belong to the planar graphs).
More generally, a forbidden graph characterization is a method of specifying a family of graph, or hypergraph, structures, by specifying substructures that are forbidden from existing within any graph in the family. Different families vary in the nature of what is forbidden. In general, a structure G is a member of a family if and only if a forbidden substructure is not contained in G. The forbidden substructure might be one of:
- subgraphs, smaller graphs obtained from subsets of the vertices and edges of a larger graph,
- induced subgraphs, smaller graphs obtained by selecting a subset of the vertices and using all edges with both endpoints in that subset,
- homeomorphic subgraphs (also called topological minors), smaller graphs obtained from subgraphs by collapsing paths of degree-two vertices to single edges, or
- graph minors, smaller graphs obtained from subgraphs by arbitrary edge contractions.
The set of structures that are forbidden from belonging to a given graph family can also be called an obstruction set for that family.
Forbidden graph characterizations may be used in algorithms for testing whether a graph belongs to a given family. In many cases, it is possible to test in polynomial time whether a given graph contains any of the members of the obstruction set, and therefore whether it belongs to the family defined by that obstruction set.
In order for a family to have a forbidden graph characterization, with a particular type of substructure, the family must be closed under substructures. That is, every substructure (of a given type) of a graph in the family must be another graph in the family. Equivalently, if a graph is not part of the family, all larger graphs containing it as a substructure must also be excluded from the family. When this is true, there always exists an obstruction set (the set of graphs that are not in the family but whose smaller substructures all belong to the family). However, for some notions of what a substructure is, this obstruction set could be infinite. The Robertson–Seymour theorem proves that, for the particular case of graph minors, a family that is closed under minors always has a finite obstruction set.
List of forbidden characterizations for graphs and hypergraphs
{{ safesubst:#invoke:Unsubst||$N=Expand list |date=__DATE__ |$B=
}}
Family | Forbidden graphs | Relation | Reference |
---|---|---|---|
Forests | loops, pairs of parallel edges, and cycles of all lengths | subgraph | Definition |
a loop (for multigraphs) or a triangle K_{3} (for simple graphs) | graph minor | Definition | |
Claw-free graphs | star K_{1,3} | induced subgraph | Definition |
Comparability graphs | induced subgraph | ||
Triangle-free graphs | triangle K_{3} | induced subgraph | Definition |
Planar graphs | K_{5} and K_{3,3} | homeomorphic subgraph | Kuratowski's theorem |
K_{5} and K_{3,3} | graph minor | Wagner's theorem | |
Outerplanar graphs | K_{4} and K_{2,3} | graph minor | Template:Harvtxt,^{[1]} p. 107 |
Outer 1-planar graphs | five forbidden minors | graph minor | Template:Harvtxt^{[2]} |
Graphs of fixed genus | a finite obstruction set | graph minor | Template:Harvtxt,^{[1]} p. 275 |
Apex graphs | a finite obstruction set | graph minor | ^{[3]} |
Linklessly embeddable graphs | The Petersen family | graph minor | ^{[4]} |
Bipartite graphs | odd cycles | subgraph | ^{[5]} |
Chordal graphs | cycles of length 4 or more | induced subgraph | ^{[6]} |
Perfect graphs | cycles of odd length 5 or more or their complements | induced subgraph | ^{[7]} |
Line graph of graphs | nine forbidden subgraphs (listed here) | induced subgraph | ^{[8]} |
Graph unions of cactus graphs | the four-vertex diamond graph formed by removing an edge from the complete graph K_{4} | graph minor | ^{[9]} |
Ladder graphs | K_{2,3} and its dual graph | homeomorphic subgraph | ^{[10]} |
Helly circular-arc graphs | induced subgraph | ^{[11]} | |
split graphs | induced subgraph | ^{[12]} | |
series-parallel (treewidth ≤ 2 branchwidth ≤ 2) | K_{4} | graph minor | Template:Harvtxt,^{[1]} p. 327 |
treewidth ≤ 3 | K_{5}, octahedron, pentagonal prism, Wagner graph | graph minor | ^{[13]} |
branchwidth ≤ 3 | K_{5}, octahedron, cube, Wagner graph | graph minor | ^{[14]} |
Complement-reducible graphs (cographs) | 4-vertex path P_{4} | induced subgraph | ^{[15]} |
Trivially perfect graphs | 4-vertex path P_{4} and 4-vertex cycle C_{4} | induced subgraph | ^{[16]} |
Threshold graphs | 4-vertex path P_{4}, 4-vertex cycle C_{4}, and complement of C_{4} | induced subgraph | ^{[16]} |
Line graph of 3-uniform linear hypergraphs | a finite list of forbidden induced subgraphs with minimum degree at least 19 | induced subgraph | ^{[17]} |
Line graph of k-uniform linear hypergraphs, k > 3 | a finite list of forbidden induced subgraphs with minimum edge degree at least 2k^{2} − 3k + 1 | induced subgraph | ^{[18]}^{[19]} |
General theorems | |||
a family defined by an induced-hereditary property | a (not necessarily finite) obstruction set | induced subgraph | |
a family defined by an minor-hereditary property | a finite obstruction set | graph minor | Robertson–Seymour theorem |
See also
References
- ↑ ^{1.0} ^{1.1} ^{1.2} {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ Béla Bollobás (1998) "Modern Graph Theory", Springer, ISBN 0-387-98488-7 p. 9
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ ^{16.0} ^{16.1} {{#invoke:citation/CS1|citation |CitationClass=citation }}..
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}