Vertex-colouring of 3-chromatic circulant graphs
From MaRDI portal
Publication:2012064
DOI10.1016/J.DAM.2017.05.013zbMATH Open1367.05079OpenAlexW2731804756MaRDI QIDQ2012064FDOQ2012064
Authors: Sara Nicoloso, Ugo Pietropaoli 
Publication date: 27 July 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.05.013
Recommendations
Cites Work
- Reducibility among combinatorial problems
- Circulants and their connectivities
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Connectivity of discrete planes
- Five-coloring maps on surfaces
- Hamiltonian decomposition of Cayley graphs of degree 4
- On the chromatic number of circulant graphs
- On planarity and colorability of circulant graphs
- 4-colorable 6-regular toroidal graphs.
- Colouring the real line
- Integral distance graphs
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Cyclic graphs
- Clique, chromatic, and Lovász numbers of certain circulant graphs
- Circulants and the chromatic index of Steiner triple systems
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Minimum chromaticity of circulant graphs
- Title not available (Why is that?)
- The chromatic number of 5-valent circulants
- Computing the Diameter in Multiple-Loop Networks
- ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- Isomorphism testing for circulant graphs \(C_n (a, b)\)
- On Six-Chromatic Toroidal Graphs
- Graph-Theoretic Concepts in Computer Science
- Computational Science and Its Applications – ICCSA 2004
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
- Colouring clique-hypergraphs of circulant graphs
- On planarity and colorability of circulant graphs
- Title not available (Why is that?)
- 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)
