On the hamiltonicity of the Cartesian product

DOI10.1016/j.ipl.2005.05.016zbMath1191.68464OpenAlexW1998232908WikidataQ56113730 ScholiaQ56113730MaRDI QIDQ1044703

Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.016

zbMATH Keywords

graphsHamiltonian cyclesinterconnection networksCartesian product

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Cyclic bundle Hamiltonicity ⋮ Gray coding cubic planar maps ⋮ Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes ⋮ Connectivity of Cartesian products of graphs ⋮ The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs ⋮ Hamilton cycles in graph bundles over a cycle with tree as a fibre

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in the cartesian product of a tree and a cycle
• Parallel concepts in graph theory
• Hamiltonian circuits in certain prisms
• Graphs with Given Group and Given Graph-Theoretical Properties
• Updating the hamiltonian problem—A survey
• Hamiltonian Cycles in Products of Graphs
• Fast Gossiping by Short Messages
• On Topological Invariants of the Product of Graphs

This page was built for publication: On the hamiltonicity of the Cartesian product