The sigma chromatic number of a graph

DOI10.1007/s00373-010-0952-7zbMath1207.05049OpenAlexW2101062861MaRDI QIDQ607685

Futaba Okamoto, Ping Zhang, Gary Chartrand

Publication date: 3 December 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0952-7

zbMATH Keywords

neighbor-distinguishing coloringsigma coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Sigma coloring on powers of paths and some families of snarks ⋮ Joins of paths and cycles of equal order with sigma chromatic number 2 ⋮ Unnamed Item ⋮ Additive list coloring of planar graphs with given girth ⋮ Algorithmic complexity of proper labeling problems ⋮ The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ ⋮ The metric chromatic number of zero divisor graph of a ring \(\mathrm{Z_n} \) ⋮ Unnamed Item ⋮ A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS ⋮ Unnamed Item ⋮ A lower bound and several exact results on the \(d\)-lucky number ⋮ Additive coloring of planar graphs ⋮ On the sigma chromatic number of the join of a finite number of paths and cycles

Cites Work

• Unnamed Item
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• Vertex colouring edge partitions

This page was built for publication: The sigma chromatic number of a graph