Long cycles in 4-connected planar graphs

DOI10.1016/j.disc.2007.11.059zbMath1170.05316OpenAlexW2010073005MaRDI QIDQ1011776

Qing Cui, Yumei Hu, Ji'an Wang

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.059

zbMATH Keywords

Hamilton cyclecontractible subgraphtutte path

Mathematics Subject Classification ID

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

Related Items

Find subtrees of specified weight and cycles of specified length in linear time, Recent advances on the Hamiltonian problem: survey III, Hamiltonian properties of polyhedra with few 3-cuts. A survey, Cycle spectra of contraction-critically 4-connected planar graphs, Distribution of subtree sums

Cites Work

• 4-connected projective planar graphs are Hamiltonian
• Cycles in 4-connected planar graphs
• A Theorem on Planar Graphs
• Uncontractable 4-connected graphs
• On Hamilton cycles in certain planar graphs
• How to Draw a Graph
• A theorem on paths in planar graphs
• Unnamed Item
• Unnamed Item