On the chromatic number of Toeplitz graphs

DOI10.1016/j.dam.2011.07.012zbMath1321.05090OpenAlexW2034798495MaRDI QIDQ496679

Sara Nicoloso, Ugo Pietropaoli

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.012

zbMATH Keywords

connectivitychromatic numbercoloringToeplitz graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (5)

Structural properties of Toeplitz graphs ⋮ Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations ⋮ Counting independent sets in Riordan graphs ⋮ Riordan graphs I: structural properties ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Long cycles and paths in distance graphs
• Colouring the real line
• Hamiltonian properties of Toeplitz graphs
• Efficiently solvable special cases of bottleneck travelling salesman problems
• On hamiltonian Toeplitz graphs
• On planarity and colorability of circulant graphs
• 4-colorable 6-regular toroidal graphs.
• Coloring planar Toeplitz graphs and the stable set polytope.
• Vertex-colouring of 3-chromatic circulant graphs
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Characterizing bipartite Toeplitz graphs

This page was built for publication: On the chromatic number of Toeplitz graphs