Hamiltonian decompositions of prisms over cubic graphs

DOI10.1016/J.DISC.2003.11.044MaRDI QIDQ1883249zbMATH OpenOpenAlexFDO

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

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

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

Cites work

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

Cited in

(13)

• A counterexample to prism-Hamiltonicity of 3-connected planar graphs
• Spanning cubic graph designs
• scientific article; zbMATH DE number 4087694 (Why is no real title available?)
• Hamiltonicity and pancyclicity of generalized prisms
• Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs
• A prime decomposition theorem for handcuff graphs in \(S^{3}\)
• Hamiltonicity and pancyclicity of Cartesian products of graphs
• A degree sum condition for graphs to be prism Hamiltonian
• The Chvátal-Erdős condition for prism-Hamiltonicity
• The prism over the middle-levels graph is Hamiltonian
• On prism-Hamiltonian bipartite graphs
• On hamiltonian cycles in the prism over the odd graphs
• On 3‐polytopes with non‐Hamiltonian prisms

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

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