Long cycles and paths in distance graphs
From MaRDI portal
Publication:712275
DOI10.1016/j.disc.2010.07.020zbMath1221.05221OpenAlexW2103501525MaRDI QIDQ712275
Jayme Luiz Szwarcfiter, Dieter Rautenbach, Lucia Draque Penso
Publication date: 28 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00017391/IfM_Preprint_M_09_11.pdf
Related Items (4)
Uniqueness results for fully anti-periodic fractional boundary value problems with nonlinearity depending on lower-order derivatives ⋮ Bipartite finite Toeplitz graphs ⋮ On the chromatic number of Toeplitz graphs ⋮ On Hamiltonian paths in distance graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring the real line
- Colouring prime distance graphs
- Hamiltonian decomposition of Cayley graphs of degree 4
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- The chromatic numbers of distance graphs
- Pancyclicity of recursive circulant graphs
- A survey on multi-loop networks.
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Hamiltonian decomposition of recursive circulant graphs
- Connectivity and diameter in distance graphs
- Circulants and their connectivities
- Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
- A solution of the isomorphism problem for circulant graphs
- Circulant graphs: recognizing and isomorphism testing in polynomial time
- Pancyclicity of connected circulant graphs
- A survey: Hamiltonian cycles in Cayley graphs
- A complementary survey on double-loop networks
This page was built for publication: Long cycles and paths in distance graphs