scientific article; zbMATH DE number 889961

zbMATH Open0857.05065MaRDI QIDQ4882477FDOQ4882477

Authors: T. Böhme, Michal Tkáč, Jochen Harant 

Publication date: 26 February 1997

Title of this publication is not available (Why is that?)

Recommendations

• Hamilton cycles in maximal planar graphs
• Each maximal planar graph with exactly two separating triangles is Hamiltonian
• Nonseparable graphs with a given number of cycles
• Any maximal planar graph with only one separating triangle is Hamiltonian

zbMATH Keywords

maximal planar graph

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Paths and cycles (05C38) Connectivity (05C40)

Cited In (9)

• Nonseparating cycles and planarity of graph-cells
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Hamiltonian-connectedness of triangulations with few separating triangles
• Non-Hamiltonian triangulations with distant separating triangles
• Separating 3-cycles in plane triangulations
• Non-Hamiltonian 1-tough triangulations with disjoint separating triangles
• Non-separating cycles and discrete Jordan curves
• On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
• Each maximal planar graph with exactly two separating triangles is Hamiltonian

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882477)