Long cycles in 3-connected graphs

Journal of Combinatorial Theory. Series B

Volumn 86, Issue 1, 2002, Pages 80-99

  Chen, Guantao ^a   Yu, Xingxing ^b  

^a GEORGIA STATE UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. D. W. Barnette, Trees in polyhedral graphs, Canad. J. Math. 18 (1966), 731-736.
2. R. Brunet, M. N. Ellingham, Z. Gao, A. Metzlar, and R. B. Richter, Spanning planar subgraphs of graphs in the torus and Klein bottle, J. Combin. Theory Ser. B 65 (1995), 7-22.
3. L. Clark, Longest cycles in 3-connected planar graphs, Congr. Numer. 47 (1985), 199-204.
4. J. Fiedler, P. Huneke, R. B. Richter, and N. Robertson, Computing the genus of projective planar graphs, J. Graph Theory 20 (1995), 297-308.
5. Z. Gao and X. Yu, Convex programming and circumference of 3-connected graphs of low genus, J. Combin. Theory Ser. B 69 (1997), 39-51.
6. B. Grünbaum and H. Walther, Shortness exponents of families of graphs, J. Combin. Theory Ser. A 14 (1973), 364-385.
7. D. A. Holton and B. D. McKay, The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combin. Theory Ser. B 45 (1988), 305-319.
8. B. Jackson and N. Wormald, Longest cycles in 3-connected planar graphs, J. Combin. Theory Ser. B 54 (1992), 291-321.
9. Moon and L. Moser, Simple paths on polyhedra, Pacific J. Math. (1963), 629-631.
10. T. Tutte, A theorem on planar graph, Trans. Amer. Math. Soc. 82 (1956), 99-116.
11. H. Whitney, A theorem on graphs, Ann. of Math. 32 (1931), 378-390.