Cycles in 4-connected planar graphs

DOI10.1016/j.ejc.2003.04.003zbMath1050.05032OpenAlexW1988068505MaRDI QIDQ1883288

Xingxing Yu, Geng-Hua Fan, Guantao Chen

Publication date: 4 October 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.04.003

zbMATH Keywords

cycleconjecture of MalkevitchTutte paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Find subtrees of specified weight and cycles of specified length in linear time ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Long cycles in 4-connected planar graphs ⋮ Cycle spectra of contraction-critically 4-connected planar graphs ⋮ Distribution of subtree sums

Cites Work

• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• 4-connected projective planar graphs are Hamiltonian
• A Theorem on Planar Graphs
• Uncontractable 4-connected graphs
• How to Draw a Graph
• A theorem on paths in planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles in 4-connected planar graphs