Sum coloring on certain classes of graphs

zbMATH Open1102.05021MaRDI QIDQ5488889FDOQ5488889

Authors: Gilbert Eyabi, Renu C. Laskar 

Publication date: 25 September 2006

Recommendations

• Full Color Theorems for L(2,1)-Colorings
• The \(L(2,1)\)-labeling on Cartesian sum of graphs
• \(L(2,1)\)-labeling of graphs: known results and open problems
• Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
• On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs

zbMATH Keywords

channel assignment problemssum coloring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Coloring the Cartesian sum of graphs
• Sum coloring of bipartite graphs with bounded degree
• Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
• Cayley sum color and anti-circulant graphs
• STACS 2004
• Generalised colouring sums of graphs
• Sum-paintability of generalized theta-graphs

This page was built for publication: Sum coloring on certain classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488889)