A degree sum condition for graphs to be prism Hamiltonian

DOI10.1016/j.disc.2008.12.028zbMath1232.05121OpenAlexW2091922850MaRDI QIDQ1043943

Kenta Ozeki

Publication date: 10 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.028

zbMATH Keywords

\(k\)-treedegree sum\(k\)-walkprism Hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs

Cites Work

• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• A method in graph theory
• Hamiltonian circuits in prisms over certain simple 3-polytopes
• Hamiltonian decompositions of prisms over cubic graphs
• The prism over the middle-levels graph is Hamiltonian
• Hamiltonian circuits in certain prisms
• Relative length of longest paths and cycles in 3-connected graphs
• Note on Hamilton Circuits
• Closure for the property of having a hamiltonian prism
• Hamiltonicity and pancyclicity of generalized prisms
• A characterization of Hamiltonian prisms
• Relative length of long paths and cycles in graphs with large degree sums
• Hamilton cycles in prisms
• Unnamed Item

This page was built for publication: A degree sum condition for graphs to be prism Hamiltonian