scientific article; zbMATH DE number 6096704
From MaRDI portal
Publication:3166186
zbMATH Open1248.05059MaRDI QIDQ3166186FDOQ3166186
Authors: Sharmila Mary Arul, J. Maria Roy Felix, Nirmala Rani 
Publication date: 21 October 2012
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 994578
- Achromatic numbers for circulant graphs and digraphs
- On the chromatic number of circulant graphs
- Approximating the achromatic number problem on bipartite graphs
- A note on circular chromatic number of graphs with large girth and similar problems
- An approximate algorithm for the chromatic number of graphs
- A class of nearly optimal circulant graphs: \(\{c_p(m,m+1,p/\alpha)\}\)
- An Improved Approximation of the Achromatic Number on Bipartite Graphs
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- On the chromatic number of integral circulant graphs
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (8)
- Vertex-colouring of 3-chromatic circulant graphs
- Achromatic numbers for circulant graphs and digraphs
- An Improved Approximation of the Achromatic Number on Bipartite Graphs
- Achromatic and harmonious colorings of circulant graphs
- An approximation algorithm for the achromatic number of mesh-like topologies
- The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$
- Computational Science and Its Applications – ICCSA 2004
- On the achromatic number of certain distance graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166186)
