Cycles in 4-connected planar graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1002024 (Why is no real title available?)
- scientific article; zbMATH DE number 4110708 (Why is no real title available?)
- scientific article; zbMATH DE number 3458515 (Why is no real title available?)
- 4-connected projective planar graphs are Hamiltonian
- A Theorem on Planar Graphs
- A theorem on paths in planar graphs
- How to Draw a Graph
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- Uncontractable 4-connected graphs
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
- Long cycles in 4-connected planar graphs
- Find subtrees of specified weight and cycles of specified length in linear time
- 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)