Characterizing bipartite Toeplitz graphs
From MaRDI portal
Publication:5941501
DOI10.1016/S0304-3975(00)00230-9zbMath0974.68145MaRDI QIDQ5941501
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Pyramidal tours and the traveling salesman problem
- Hamiltonian properties of Toeplitz graphs
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Hamiltonian cycles in circulant digraphs with two stripes
- Circulants and their connectivities
- Connectivity of circulant digraphs
- Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems