On Hamiltonian paths in distance graphs

DOI10.1016/J.AML.2011.01.025zbMATH Open1223.05141OpenAlexW1999561962MaRDI QIDQ533446FDOQ533446

Authors: Christian Löwenstein, Dieter Rautenbach, Friedrich Regen 

Publication date: 3 May 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.01.025

Recommendations

• On Hamiltonian paths and cycles in sufficiently large distance graphs
• Long cycles and paths in distance graphs
• Hamiltonian paths in distance graphs
• On Hamiltonian paths with prescribed edge lengths in the complete graph
• scientific article; zbMATH DE number 7103402

zbMATH Keywords

Hamiltonian cycleHamiltonian pathcirculant graphdistance graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Paths and cycles (05C38)

Cites Work

• A survey on multi-loop networks.
• Circulants and their connectivities
• Hamiltonian decomposition of recursive circulant graphs
• A solution of the isomorphism problem for circulant graphs
• Title not available (Why is that?)
• Long cycles and paths in distance graphs
• The chromatic numbers of distance graphs
• Colouring the real line
• Chromatic numbers of integer distance graphs
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Efficiently solvable special cases of bottleneck travelling salesman problems
• Colouring prime distance graphs
• Powers of cycles, powers of paths, and distance graphs
• Pancyclicity of recursive circulant graphs
• A complementary survey on double-loop networks
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Colouring of distance graphs
• Connectivity and diameter in distance graphs
• Title not available (Why is that?)
• Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
• Title not available (Why is that?)
• Pancyclicity of connected circulant graphs
• Cycles, Paths, Connectivity and Diameter in Distance Graphs

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian paths in distance graphs
• Long cycles and paths in distance graphs
• Hamilton paths in certain arithmetic graphs.
• Title not available (Why is that?)
• Absolute differences along Hamiltonian paths
• On Hamiltonian paths and cycles in sufficiently large distance graphs

This page was built for publication: On Hamiltonian paths in distance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533446)