On prism-Hamiltonian bipartite graphs

MaRDI QIDQ6200549FDOQ6200549

Authors: Simon Špacapan, Peter Horák 

Publication date: 22 March 2024

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/88/ajc_v88_p194.pdf

Recommendations

• Prism‐hamiltonicity of triangulations
• A characterization of Hamiltonian prisms
• Hamilton cycles in prisms
• The prism over the middle-levels graph is Hamiltonian
• Polyhedra without cubic vertices are prism-hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• The prism over the middle-levels graph is Hamiltonian
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Title not available (Why is that?)
• A characterization of Hamiltonian prisms
• Hamilton cycles in prisms
• Prism‐hamiltonicity of triangulations
• Proof of the middle levels conjecture
• Toughness and prism-Hamiltonicity of \(P_4\)-free graphs
• Two sufficient conditions for a 2-factor in a bipartite graph
• Hamiltonian decompositions of prisms over cubic graphs
• On the Hamiltonian property hierarchy of 3-connected planar graphs

This page was built for publication: On prism-Hamiltonian bipartite graphs

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