Recommendations
- scientific article; zbMATH DE number 77956
- On the chromatic number of graphs
- scientific article; zbMATH DE number 4128832
- On the total set chromatic number of graphs
- scientific article; zbMATH DE number 4085672
- A note on total chromatic numbers of graphs
- scientific article; zbMATH DE number 773170
- scientific article; zbMATH DE number 742642
- Some results on total chromatic number of a graph
- Coloring Toeplitz graphs
Cites work
- 4-colorable 6-regular toroidal graphs.
- Characterizing bipartite Toeplitz graphs
- Circulants and the chromatic index of Steiner triple systems
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Coloring planar Toeplitz graphs and the stable set polytope.
- Colouring the real line
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Hamiltonian properties of Toeplitz graphs
- Long cycles and paths in distance graphs
- On hamiltonian Toeplitz graphs
- On planarity and colorability of circulant graphs
- Vertex-colouring of 3-chromatic circulant graphs
Cited in
(10)- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
- Coloring Toeplitz graphs
- Counting independent sets in Riordan graphs
- Toeplitz graph decomposition
- Structural properties of Toeplitz graphs
- Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7
- Riordan graphs I: structural properties
- On planar Toeplitz graphs
- To an extremal problem on chromatic numbers of finite graphs
- Hamiltonicity in directed Toeplitz graphs \(T_n\langle 1, 2; t_1, t_2\rangle\)
This page was built for publication: On the chromatic number of Toeplitz graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496679)
