The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$

DOI10.1007/978-3-319-48532-4_19zbMath1482.05117OpenAlexW2549539770MaRDI QIDQ2958104

Mari-jo P. Ruiz, Mark Anthony C. Tolentino, Paul Adrian D. Luzon

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48532-4_19

zbMATH Keywords

circulant graphsneighbor-distinguishing coloringsigma coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Sigma coloring on powers of paths and some families of snarks ⋮ Unnamed Item

Cites Work

• The sigma chromatic number of a graph
• Lucky labelings of graphs
• On the chromatic number of circulant graphs
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• On planarity and colorability of circulant graphs
• The set chromatic number of a graph

This page was built for publication: The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$