Long cycles in graphs on a fixed surface

DOI10.1006/jctb.2001.2108zbMath1025.05035OpenAlexW2081444699MaRDI QIDQ1850617

Carsten Thomassen, Thomas Böhme, Bojan Mohar

Publication date: 10 December 2002

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

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

zbMATH Keywords

pathsembeddingcircumferenceface-widthEuler genus

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (13)

A theorem on paths in locally planar triangulations ⋮ Chords of longest circuits in locally planar graphs ⋮ The circumference of a graph with no \(K_{3,t}\)-minor ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Finding large cycles in Hamiltonian graphs ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ Cycles in 5-connected triangulations ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Subdivisions ofK₅in Graphs Embedded on Surfaces With Face-Width at Least 5 ⋮ Tutte paths and long cycles in circuit graphs

Cites Work

• Unnamed Item
• Generating locally-cyclic triangulations of surfaces
• Longest cycles in 3-connected planar graphs
• Embeddings of graphs with no short noncontractible cycles
• Graph minors. VII: Disjoint paths on a surface
• On 2-connected spanning subgraphs with low maximum degree
• Relative lengths of paths and cycles in 3-connected graphs
• Five-coloring maps on surfaces
• Trees in triangulations
• 4-connected projective planar graphs are Hamiltonian
• Spanning trees in locally planar triangulations
• 2-connected spanning subgraphs of planar 3-connected graphs
• Convex programming and circumference of 3-connected graphs of low genus
• Color-critical graphs on a fixed surface
• Nonhamiltonian triangulations with large connectivity and representativity
• Shortness exponents of families of graphs
• Simple paths on polyhedra
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• 2‐connected coverings of bounded degree in 3‐connected graphs
• Trees in Polyhedral Graphs
• A theorem on paths in planar graphs

This page was built for publication: Long cycles in graphs on a fixed surface