Any maximal planar graph with only one separating triangle is Hamiltonian
From MaRDI portal
Publication:1411340
DOI10.1023/A:1021998507140zbMath1046.90072MaRDI QIDQ1411340
Publication date: 27 October 2003
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Related Items (8)
Two-page book embeddings of 4-planar graphs ⋮ A survey on book-embedding of planar graphs ⋮ Each maximal planar graph with exactly two separating triangles is Hamiltonian ⋮ On Jones' subgroup of R. Thompson group \(F\) ⋮ 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 ⋮ On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
This page was built for publication: Any maximal planar graph with only one separating triangle is Hamiltonian
