A characterization of graphs with no cube minor

Journal of Combinatorial Theory. Series B

Volumn 80, Issue 2, 2000, Pages 179-201

  Maharry, John ^a  

^a Faculty of Social and Political Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (13)

1. Dirac G. A. In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen. Math. Nachr. 22:1960;61-85.
2. Dirac G. A. Some results concerning the structure of graphs. Canad. Math. Bull. 6:1963;183-210.
3. Fontet M. Connectivité des graphes et automorphismes de cartes: Propriétés et algorithmes. 1979;Université P. et M. Curie, Paris.
4. Glover H., Huneke J. P., Wang C. S. 103 Graphs that are irreducible for the projective plane. J. Combin. Theory Ser. B. 27:1979;332-370.
5. Lovász L. Független köröket nem tartalmazó gráfokról. Mat. Lapok. 16:1965;289-299.
6. Kelmans A. K. Graph planarity and related topics. Contemp. Math. 147:1993;635-667.
7. Maharry J. A Characterization of Graphs with No Cube Minor. 1996;The Ohio State University.
8. Martinov N. Uncontractible 4-connected graphs. J. Graph Theory. 6:1982;343-344.
9. N. Robertson, personal communication.
10. N. Robertson, P. D. Seymour, and, R. Thomas, Excluded minors in cubic graphs, submitted for publication.
11. Tutte W. T. Connectivity in Graphs. 1966;Univ. of Toronto Press, Toronto Oxford Univ. Press, London, London.
12. Wagner K. Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114:1937;570-590.
13. Wormald N. C. Classifying k-connected cubic graphs. Lecture Notes in Mathematics. 1979;Springer-Verlag, Berlin/New York. p. 199-206.