scientific article; zbMATH DE number 3843793

MaRDI QIDQ3313897zbMATH OpenFDO

Authors Bojan Mohar

Publication date 1984

zbMATH Keywords

forbidden subgraphsHamiltonian circuitsimple 3-polytope

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Recommendations

• Every simple 3-polytype with 34 vertices is Hamiltonian
• Hamiltonian simple polytopes
• scientific article; zbMATH DE number 3910429
• Are all simple 4-polytopes Hamiltonian?
• Polyhedra of small order and their Hamiltonian properties

Cited in

(4)

• Every simple 3-polytype with 34 vertices is Hamiltonian
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Polyhedra of small order and their Hamiltonian properties
• scientific article; zbMATH DE number 3910429 (Why is no real title available?)

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 Q3313897)