Excluding pairs of graphs
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorphic to a member of H. Given an integer P>0, a graph G, and a set of graphs F, we say that G admits an (F,P)-partition if the vertex set of G can be partitioned into P subsets X1, . . XP, so that...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2014
|