Hamiltonicity and pancyclicity of Cartesian products of graphs
From MaRDI portal
Publication:1045164
DOI10.1016/j.disc.2008.11.024zbMath1189.05094OpenAlexW2019318707MaRDI QIDQ1045164
Roman Čada, Hao Li, Evelyne Flandrin
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.11.024
Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
Vertex pancyclicity over lexicographic products ⋮ The Menger number of the Cartesian product of graphs ⋮ Arbitrary partitionability of product graphs ⋮ The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs ⋮ Cycles in complementary prisms
Cites Work
- Chain packing in graphs
- Hamiltonian decompositions of prisms over cubic graphs
- Hamiltonian circuits in certain prisms
- Path factors in cubic graphs
- Almost claw‐free graphs
- A characterization of Hamiltonian prisms
- Pancyclicity of the prism
- Asymptotically optimal tree-packings in regular graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Hamiltonicity and pancyclicity of Cartesian products of graphs
