Excluding any graph as a minor allows a low tree-width 2-coloring

Journal of Combinatorial Theory. Series B

Volumn 91, Issue 1, 2004, Pages 25-41

  DeVos, Matt ^a   Ding, Guoli ^b   Oporowski, Bogdan ^b   Sanders, Daniel P ^c   Reed, Bruce ^d   Seymour, Paul ^a   Vertigan, Dirk ^b  

^a PRINCETON UNIVERSITY   (United States)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c SORBONNE UNIVERSITÉ   (France)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Edge partitions; Small components; Tree width; Vertex partitions

Indexed keywords

EID: 2342457822     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2003.09.001     Document Type: Article

References (10)

1. G. Chartrand, D. Geller, S. Hedetniemi, Graphs with forbidden subgraphs, J. Combin. Theory Ser. B 10 (1971) 12-41.
2. G. Ding, B. Oporowski, D.P. Sanders, D. Vertigan, Partitioning graphs of bounded tree-width, Combinatorica 18 (1) (1998) 1-12.
3. G. Ding, B. Oporowski, D.P. Sanders, D. Vertigan, Surfaces, tree-width, clique-minors, and partitions, J. Combin. Theory Ser. B 79 (2000) 221-246.
4. N. Robertson, P.D. Seymour, private communication.
5. N. Robertson, P.D. Seymour, Graph Minors. III. Planar tree-width, J. Combin. Theory Ser. B 36 (1984) 49-64.
6. N. Robertson, P.D. Seymour, Graph Minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986) 92-114.
7. N. Robertson, P.D. Seymour, Graph Minors. XVI. Excluding a non-planar graph, J. Combin. Theory Ser. B 89 (2003) 43-76.
8. N. Robertson, P.D. Seymour, Graph Minors. XX. Wagner's conjecture, (1988), submitted for publication.
9. N. Robertson, P.D. Seymour, R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B 62 (1994) 323-348.
10. R. Thomas, Problem Session of the Third Slovene Conference on Graph Theory, Bled, Slovenia, 1995.