On the hamiltonicity of the Cartesian product

DOI10.1016/j.ipl.2005.05.016zbMath1191.68464WikidataQ56113730 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

graphs; Hamiltonian cycles; interconnection networks; Cartesian product

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

Related Items

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

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