Sum coloring on certain classes of graphs

MaRDI QIDQ5488889zbMATH OpenFDO

Authors Gilbert Eyabi, Renu C. Laskar

Publication date 25 September 2006

zbMATH Keywords

channel assignment problemssum coloring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cited in

(8)

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

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)