Convex programming and circumference of 3-connected graphs of low genus

Journal of Combinatorial Theory. Series B

Volumn 69, Issue 1, 1997, Pages 39-51

  Gao, Zhicheng ^a   Yu, Xingxing ^b  

^a CARLETON UNIVERSITY   (Canada)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (14)

1. 1. D. W. Barnette, Trees in polyhedral graphs, Canad. J. Math. 18 (1966), 731-736.
2. 2. E. A. Bender, Z. C. Gao, and L. B. Richmond, Submap of maps. I. general 0-1 laws, J. Combin. Theory Ser. B 55 (1992), 104-117.
3. 3. J. A. Bondy and U. S. R. Murty, "Graph Theory with Applications," American Elsevier, New York, 1976.
4. 4. R. Brunei, M. Ellingham, Z. C. Gao, A. Metzlar, and R. B. Richter, Spanning planar subgraphs of toroidal embeddings, J. Combin. Theory Ser. B 65 (1995), 7-22.
5. 5. L. Clark, Longest cycles in 3-connected planar graphs, Congr. Numer. 47 (1985), 199-204.
6. 6. B. Jackson and N. C. Wormald, Longest cycles in 3-connected planar graphs, J. Combin. Theory Ser. B 54 (1992), 291-321.
7. 7. J. W. Moon and L. Moser, Simple paths on polyhedra, Pacific J. Math. 13 (1963), 629-631.
8. 8. Z. C. Gao and R. B. Richter, 2-walks in circuit graphs, J. Combin. Theory Ser. B 62 (1994), 259-267.
9. 9. B. Grunbaum and H. Walther, Shortness exponents of families of graphs, J. Combin. Theory Ser. A 14 (1973), 364-385.
10. 10. M. D. Plummer and E. L. Wilson, On cycles and connectivity in planar graphs, Canad J. Math. 16 (1973), 283-288.
11. 11. L. B. Richmond and N. C. Wormald, Random triangulations of the plane, Europ. J. Combin. 9 (1988), 61-71.
12. 12. R. T. Rockafeller, "Convex Analysis," Princeton Univ. Press, Princeton, NJ, 1970.
13. 13. D. P. Sanders, On paths in planar graphs, preprint.
14. 14. W. T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956), 99-116.