Cycles in 4-connected planar graphs
From MaRDI portal
Publication:1883288
DOI10.1016/J.EJC.2003.04.003zbMATH Open1050.05032OpenAlexW1988068505MaRDI QIDQ1883288FDOQ1883288
Authors: Xingxing Yu, Guantao Chen, Genghua Fan 
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Uncontractable 4-connected graphs
- Title not available (Why is that?)
- A Theorem on Planar Graphs
- How to Draw a Graph
- 4-connected projective planar graphs are Hamiltonian
- A theorem on paths in planar graphs
- Title not available (Why is that?)
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
Cited In (12)
- Distribution of subtree sums
- Recent advances on the Hamiltonian problem: survey III
- Hamiltonian properties of polyhedra with few 3-cuts. A survey
- Find subtrees of specified weight and cycles of specified length in linear time
- Long cycles in 4-connected planar graphs
- On longest cycles in essentially 4-connected planar graphs
- On longest cycles in essentially 4-connected planar graphs
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
- Cycle spectra of contraction-critically 4-connected planar graphs
- Cycles in 4-connected planar graphs
- Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
This page was built for publication: Cycles in 4-connected planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883288)
