Characterizing bipartite Toeplitz graphs

DOI10.1016/S0304-3975(00)00230-9zbMath0974.68145OpenAlexW1973860023MaRDI QIDQ5941501

Reinhardt Euler

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00230-9

zbMATH Keywords

Toeplitz graph

Mathematics Subject Classification ID

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

Related Items (13)

Coloring Toeplitz graphs ⋮ Every matrix is a product of Toeplitz matrices ⋮ On Super Edge-Antimagic Total Labeling of Toeplitz Graphs ⋮ Hamiltonian Connectedness of Toeplitz Graphs ⋮ Structural properties of Toeplitz graphs ⋮ On planar Toeplitz graphs ⋮ The property of Hamiltonian connectedness in Toeplitz graphs ⋮ Counting independent sets in Riordan graphs ⋮ Coloring planar Toeplitz graphs and the stable set polytope. ⋮ Bipartite finite Toeplitz graphs ⋮ On the chromatic number of Toeplitz graphs ⋮ Riordan graphs I: structural properties ⋮ Unnamed Item

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

This page was built for publication: Characterizing bipartite Toeplitz graphs