On the chromatic number of Toeplitz graphs

Authors:
Sara Nicoloso;Ugo Pietropaoli
Affiliations:
IASI - CNR, Viale Manzoni 30, 00185 Roma, Italy;Universití di Roma Tor Vergata, Dipartimento di Ingegneria dell'Impresa, Via del Politecnico 1, 00133 Roma, Italy
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 5
Cited 1

Efficiently solvable special cases of bottleneck travelling salesman problems

Discrete Applied Mathematics
Characterizing bipartite Toeplitz graphs

Theoretical Computer Science
On Hamiltonian Toeplitz graphs

Discrete Mathematics
On planarity and colorability of circulant graphs

Discrete Mathematics
Circular chromatic number of distance graphs with distance sets of cardinality 3

Journal of Graph Theory

Bipartite finite Toeplitz graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Let n,a"1,a"2,...,a"k be distinct positive integers. A finite Toeplitz graph T"n(a"1,a"2,...,a"k)=(V,E) is a graph where V={v"0,v"1,...,v"n"-"1} and E={v"iv"j, for |i-j|@?{a"1,a"2,...,a"k}}. In this paper, we first refine some previous results on the connectivity of finite Toeplitz graphs with k=2, and then focus on Toeplitz graphs with k=3, proving some results about their chromatic number.