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