Excluding Minors in Nonplanar Graphs of Girth at Least Five

Combinatorics Probability and Computing

Volumn 9, Issue 6, 2000, Pages 573-585

  Thomas, Robin ^a   Thomson, Jan McDonald ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034556209     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300004417     Document Type: Article

References (19)

1. Aldred, E. R. L., Holton, D. A. and Jackson, B. (1991) Uniform cyclic edge connectivity in cubic graphs. Combinatorica 11 81-96.
2. Appel, K. and Haken, W. (1977) Every planar map is four colorable, Part I: discharging. Illinois J. Math. 21 429-490.
3. Appel, K., Haken, W. and Koch, J. (1977) Every planar map is four colorable, Part II: reducibility. Illinois J. Math. 21 491-567.
4. Appel, K. and Haken, W. (1989) Every Planar Map is Four Colorable. Vol. 98 of Contemporary Mathematics, American Mathematical Society.
5. Bollobás, B. (1979) Graph Theory, Springer, New York.
6. Kilakos, K. and Shepherd, B. (1996) Excluding minors in cubic graphs. Combin. Probab. Comput. 5 57-78.
7. McCuaig, W. (1987) Edge-reductions in cyclically k-connected cubic graphs. PhD thesis, University of Waterloo, Waterloo, Ontario.
8. McCuaig, W. (1992) Edge-reductions in cyclically k-connected cubic graphs. J. Combin. Theory Ser. B 56 16-44.
9. Robertson, N., Sanders, D. P., Seymour, P. D. and Thomas, R. (1997) The four-colour theorem. J. Combin. Theory Ser. B 70 2-44.
10. Robertson, N., Seymour, P. D. and Thomas, R. (1996) Cyclically 5-connected cubic graphs. Manuscript.
11. Robertson, N., Seymour, P. D. and Thomas, R. (1996) Excluded minors in cubic graphs. Manuscript.
12. Robertson, N., Seymour, P. D. and Thomas, R. (1997) Tutte's edge-colouring conjecture. J. Combin. Theory Ser. B 70 166-183.
13. Robertson, N., Seymour, P. D. and Thomas, R. (2000) Non-planar extensions of planar graphs. Available from http://www.math.gatech.edu/~thomas/ext.ps.
14. Sanders, D. P., Seymour, P. D. and Thomas, R. Edge three-coloring cubic doublecross graphs. In preparation.
15. Sanders, D. P. and Thomas, R. (2000) Edge three-coloring cubic apex graphs. Manuscript.
16. Seymour, P. D. (1995) Nowhere-zero flows. In Handbook of Combinatorics (Graham, Grötschel and Lovász, eds), North-Holland, pp. 289-300.
17. Tait, P. G. (1880) Note on a theorem in geometry of position. Trans. Roy. Soc. Edinburgh 29 657-660.
18. Tutte, W. T. (1966) On the algebraic theory of graph colorings. J. Combin. Theory Ser. B 1 15-50.
19. Zhang, C.-Q. (1997) Integer Flows and Cycle Covers of Graphs, Marcel Dekker, New York.