scientific article; zbMATH DE number 889961

MaRDI QIDQ4882477zbMATH OpenFDO

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

Publication date 26 February 1997

zbMATH Keywords

maximal planar graph

Mathematics Subject Classification ID

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

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

Cited in

(11)

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

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)