scientific article; zbMATH DE number 7822854

MaRDI QIDQ6200549

Peter Horák, Simon Špacapan

Publication date: 22 March 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

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

This page was built for publication: