Efficiently solvable special cases of bottleneck travelling salesman problems
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On planarity and colorability of circulant graphs
Discrete Mathematics
On the chromatic number of Toeplitz graphs
Discrete Applied Mathematics
Bipartite finite Toeplitz graphs
Discrete Applied Mathematics
| Hi-index | 5.23 |
A Toeplitz graph is a symmetric graph whose adjacency matrix is Toeplitz. If such a graph has neither loops nor multiple edges it can be defined by a 0-1 sequence. In Euler et al. (in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory '95, vol. 1, Academia Sinica, World Scientific, Singapore, 1995, pp. 119-130) infinite, bipartite Toeplitz graphs have been fully characterized. In this paper we complete these results by some structural and algorithmic properties and then turn ourselves to study the .nite case. We present a complete solution for bipartite Toeplitz graphs that are defined by a 0-1 sequence with two 1-entries, and we present several partial results for those defined by a 0-1 sequence with three 1-entries.