Surfaces, Tree-Width, Clique-Minors, and Partitions

Journal of Combinatorial Theory. Series B

Volumn 79, Issue 2, 2000, Pages 221-246

  Ding, Guoli ^a   Oporowski, Bogdan ^a   Sanders, Daniel P ^b   Vertigan, Dirk ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242449041     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.1962     Document Type: Article

References (37)

1. Appel K., Haken W. Every planar map is four colorable. Contemp. Math. 98:1989.
2. Arnborg S. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT. 25:1985;2-23.
3. Arnborg S., Corneil D. G., Proskurowski A. Forbidden minors characterization of partial 3-trees. Discrete Math. 80:1990;1-19.
4. Arnborg S., Proskurowski A. Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods. 7:1986;305-314.
5. Borodin O. V. On acyclic colorings of planar graphs. Discrete Math. 25:1979;211-236.
6. Chartrand G., Geller D., Hedetniemi S. Graphs with forbidden subgraphs. J. Combin. Theory Ser. B. 10:1971;12-41.
7. Chartrand G., Kronk H. V. The point-arboricity of planar graphs. J. London Math. Soc. 44:1969;612-616.
8. Chartrand G., Kronk H. V., Wall C. E. The point-arboricity of a graph. Israel J. Math. 6:1968;169-175.
9. Colbourn C. J., Elmallah E. S. Partitioning the edges of a planar graph into two partial k-trees. Congr. Numer. 66:1988;69-80.
10. G. Ding, B. Oporowski, B. Reed, D. P. Sanders, P. D. Seymour, and, D. Vertigan, Excluding any graph as a minor allows a low tree-width 2-coloring, preprint.
11. Fiedler J. R., Huneke J. P., Richter R. B., Robertson N. Computing the orientable genus of projective graphs. J. Graph Theory. 20:1995;297-308.
12. Hadwiger H. Über eine Klassifikation der Streckenkomplexe. Vierteljschr. Naturforsch. Gesellsch. Zürich. 88:1943;133-142.
13. Jensen T. R., Toft B. Problem 6.3. The (m, n)- and [m, n]-conjectures. Graph Coloring Problems. 1995;Wiley, New York. p. 112-114.
14. 8. J. Graph Theory. 18:1994;431-448.
15. L. K. Jørgensen, private conversation at the Fifteenth British Combinatorial Conference, Stirling, Scotland, 1995.
16. 5 minors, manuscript, 1995.
17. Kedlaya K. S. Outerplanar partitions of planar graphs. J. Combin. Theory Ser. B. 67:1996;238-248.
18. Mader W. Homomorphiesätze für Graphen. Math. Ann. 178:1968;154-168.
19. Nash-Williams C. St. J. Decompositions of finite graphs into forests. J. London Math. Soc. 39:1964;12.
20. Robertson N., Sanders D. P., Seymour P. D., Thomas R. The four-colour theorem. J. Combin. Theory Ser. B. 70:1997;2-44.
21. Robertson N., Seymour P. D. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms. 7:1986;309-322.
22. Robertson N., Seymour P. D. Graph minors. III. Planar tree-width. J. Combin. Theory Ser. B. 36:1984;49-64.
23. Robertson N., Seymour P. D. Graph minors. IV. Tree-width and well-quasi-ordering. J. Combin. Theory Ser. B. 48:1990;227-254.
24. 6-free graphs. Combinatorica. 13:1993;279-361.
25. Sanders D. P. Linear Agorithms for Graphs of Tree-Width at Most Four. Program of Algorithms, Combinatorics, and Optimization. 1993;Georgia Institute of Technology.
26. Sanders D. P. On Hamiltonian cycles in certain planar graphs. J. Graph Theory. 21:1996;43-50.
27. Sanders D. P. On linear recognition of tree-width at most four. SIAM J. Discrete Math. 9:1996;101-117.
28. Sanders D. P., Zhao Y. On 2-connected spanning subgraphs with low maximum degree. J. Combin. Theory Ser. B. 74:1998;64-86.
29. Satyanarayana A., Tung L. A characterization of partial 3-trees. Networks. 20:1990;299-322.
30. Sedláček J. O jednom zobecněnívnějškově rovinných grafu (On a generalization of outerplanar graphs). Čas. Pěst. Mat. 113:1988;213-218.
31. Seymour P. D. Disjoint paths in graphs. Discrete Math. 29:1980;293-309.
32. P. D. Seymour, and, R. Thomas, private conversation at the Third Slovene Conference on Graph Theory, Bled, Slovenia, 1995.
33. R. Thomas, Problem session of the Third Slovene Conference on Graph Theory, Bled, Slovenia, 1995.
34. Thomason A. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95:1984;261-265.
35. Tutte W. T. A theorem on planar graphs. Trans. Amer. Math. Soc. 82:1956;99-116.
36. Wagner K. Beweis einer Abschwächung der Hadwiger-Vermutung. Math. Ann. 153:1964;139-141.
37. X. Zha, and, Y. Zhao, manuscript, 1992.