Hamiltonian decompositions of prisms over cubic graphs
From MaRDI portal
Using a method based on colored diagrams, the authors show that the prism over 3-connected planar bipartite cubic graphs and certain duals have a decomposition into two Hamilton cycles.
Cites work
Cited in
(13)- A degree sum condition for graphs to be prism Hamiltonian
- Spanning cubic graph designs
- Hamiltonicity and pancyclicity of Cartesian products of graphs
- The Chvátal-Erdős condition for prism-Hamiltonicity
- A counterexample to prism-Hamiltonicity of 3-connected planar graphs
- A prime decomposition theorem for handcuff graphs in \(S^{3}\)
- The prism over the middle-levels graph is Hamiltonian
- On hamiltonian cycles in the prism over the odd graphs
- Hamiltonicity and pancyclicity of generalized prisms
- Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs
- scientific article; zbMATH DE number 4087694 (Why is no real title available?)
- On 3‐polytopes with non‐Hamiltonian prisms
- On prism-Hamiltonian bipartite 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)