Long cycles in graphs on a fixed surface

DOI10.1006/JCTB.2001.2108MaRDI QIDQ1850617zbMATH OpenOpenAlexFDO

Authors T. Böhme, Bojan Mohar, Carsten Thomassen

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

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

Recommendations

• Long cycles in 3‐connected graphs in orientable surfaces
• Long cycles in 3-connected graphs
• Finding large cycles in Hamiltonian graphs
• On Short Noncontractible Cycles in Embedded Graphs
• A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface

Cites work

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

Cited in

(17)

• Long cycles in 3‐connected graphs in orientable surfaces
• Covering nearly surface-embedded graphs with a fixed number of balls
• Tutte paths and long cycles in circuit graphs
• On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs
• Subgraphs of graphs on surfaces with high representativity
• Cycles in 5-connected triangulations
• A theorem on paths in locally planar triangulations
• On Short Noncontractible Cycles in Embedded Graphs
• The circumference of a graph with no \(K_{3,t}\)-minor. II
• On certain spanning subgraphs of embeddings with applications to domination
• The circumference of a graph with no \(K_{3,t}\)-minor
• Chords of longest circuits in locally planar graphs
• A note on traversing specified vertices in graphs embedded with large representativity
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5
• Finding large cycles in Hamiltonian graphs
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• 2-connected spanning subgraphs with low maximum degree in locally planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850617)