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

DOI10.1006/jctb.1996.1719zbMath0867.05041OpenAlexW2013837525MaRDI QIDQ1354114

Xingxing Yu, Zhi-Cheng Gao

Publication date: 3 August 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.1719

zbMATH Keywords

torusprojective planeconnectivitycircumferenceKlein bottlelongest cyclecircuit graphTutte path

Mathematics Subject Classification ID

Convex programming (90C25) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (7)

The circumference of a graph with no \(K_{3,t}\)-minor ⋮ Tutte cycles in circuit graphs ⋮ Enumerative properties of rooted circuit maps ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs ⋮ Long cycles in graphs on a fixed surface ⋮ Long cycles in 3-connected graphs

This page was built for publication: Convex programming and circumference of 3-connected graphs of low genus