Long cycles in 3‐connected graphs in orientable surfaces

DOI10.1002/jgt.10051zbMath1012.05098OpenAlexW4247157728MaRDI QIDQ4798104

Laura Sheppardson, Xingxing Yu

Publication date: 19 March 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10051

zbMATH Keywords

cycle3-connectedcircuit graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15)

Related Items (3)

The circumference of a graph with no \(K_{3,t}\)-minor ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

This page was built for publication: Long cycles in 3‐connected graphs in orientable surfaces