2- and 3-factors of graphs on surfaces

DOI10.1002/jgt.20533zbMath1231.05148OpenAlexW2107127651MaRDI QIDQ5199420

Kenta Ozeki, Ken-ichi Kawarabayashi

Publication date: 16 August 2011

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

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

zbMATH Keywords

Hamiltonian cyclefactorsgraphs on a surface

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

\([a,b\)-factors of graphs on surfaces] ⋮ Matching Extension Missing Vertices and Edges in Triangulations of Surfaces

Cites Work

• Embeddings of graphs with no short noncontractible cycles
• Locally planar graphs are 5-choosable
• Graph minors. VII: Disjoint paths on a surface
• Five-coloring maps on surfaces
• Trees in triangulations
• 4-connected projective planar graphs are Hamiltonian
• Five-connected toroidal graphs are Hamiltonian
• A theorem on paths in locally planar triangulations
• Nonhamiltonian triangulations with large connectivity and representativity
• Hamilton paths in toroidal graphs
• Simple paths on polyhedra
• Disjoint paths, planarizing cycles, and spanning walks
• The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
• A Theorem on Planar Graphs
• Polytopes, graphs, and complexes
• The Factors of Graphs
• A theorem on paths in planar graphs

This page was built for publication: 2- and 3-factors of graphs on surfaces