Hamiltonian decompositions of prisms over cubic graphs

DOI10.1016/J.DISC.2003.11.044zbMATH Open1052.05041OpenAlexW1976733051MaRDI QIDQ1883249FDOQ1883249

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

• Graph theory
• Inductive definition of two restricted classes of triangulations
• A characterization of Hamiltonian prisms
• Hamiltonian circuits in certain prisms
• 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
• Title not available (Why is that?)
• 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
• On prism-Hamiltonian bipartite graphs
• The prism over the middle-levels graph is Hamiltonian
• On 3‐polytopes with non‐Hamiltonian prisms
• On hamiltonian cycles in the prism over the odd graphs

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)