Hamiltonian decompositions of prisms over cubic graphs

DOI10.1016/j.disc.2003.11.044zbMath1052.05041OpenAlexW1976733051MaRDI QIDQ1883249

Roman Čada, Zdeněk Ryjáček, Tomáš Kaiser, Moshe Rosenfeld

Publication date: 1 October 2004

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

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

zbMATH Keywords

prismcubic graphsHamilton cycleHamiltonian decomposition.

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

The Chvátal-Erdős condition for prism-Hamiltonicity ⋮ On 3‐polytopes with non‐Hamiltonian prisms ⋮ Unnamed Item ⋮ A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ The prism over the middle-levels graph is Hamiltonian ⋮ On hamiltonian cycles in the prism over the odd graphs ⋮ A degree sum condition for graphs to be prism Hamiltonian ⋮ Spanning cubic graph designs ⋮ Hamiltonicity and pancyclicity of Cartesian products of graphs ⋮ Hamiltonicity and pancyclicity of generalized prisms

Cites Work

• Unnamed Item
• Inductive definition of two restricted classes of triangulations
• On Hamilton decompositions of prisms over simple 3-polytopes
• Hamiltonian circuits in certain prisms
• A characterization of Hamiltonian prisms

This page was built for publication: Hamiltonian decompositions of prisms over cubic graphs