Vertex-colouring of 3-chromatic circulant graphs
From MaRDI portal
Publication:2012064
Recommendations
Cites work
- scientific article; zbMATH DE number 1507223 (Why is no real title available?)
- 4-colorable 6-regular toroidal graphs.
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- Circulants and the chromatic index of Steiner triple systems
- Circulants and their connectivities
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Clique, chromatic, and Lovász numbers of certain circulant graphs
- Colouring the real line
- Computational Science and Its Applications – ICCSA 2004
- Computing the Diameter in Multiple-Loop Networks
- Connectivity of discrete planes
- Cyclic graphs
- Five-coloring maps on surfaces
- Graph-Theoretic Concepts in Computer Science
- Hamiltonian decomposition of Cayley graphs of degree 4
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Integral distance graphs
- Isomorphism testing for circulant graphs \(C_n (a, b)\)
- Minimum chromaticity of circulant graphs
- On Six-Chromatic Toroidal Graphs
- On planarity and colorability of circulant graphs
- On the chromatic number of circulant graphs
- ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
- Reducibility among combinatorial problems
- The chromatic number of 5-valent circulants
Cited in
(14)- Chromatic numbers of Cayley graphs of abelian groups: a matrix method
- Minimum chromaticity of circulant graphs
- 3-colouring for dually chordal graphs and generalisations
- Bipartite finite Toeplitz graphs
- Chromatic number of circulant graph \(C_{n+1}\langle 1, 3\rangle\) after subdividing all or some of its edges
- Coloring Toeplitz graphs
- Circular chromatic index of graphs of maximum degree 3
- Dense bipartite circulants and their routing via rectangular twisted torus
- On planarity and colorability of circulant graphs
- Colouring clique-hypergraphs of circulant graphs
- scientific article; zbMATH DE number 5139507 (Why is no real title available?)
- On the chromatic number of Toeplitz graphs
- Computational Science and Its Applications – ICCSA 2004
- 3-consecutive C-colorings of graphs
This page was built for publication: Vertex-colouring of 3-chromatic circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012064)
