Total colorings of graphs with minimum sum of colors
From MaRDI portal
(Redirected from Publication:503645)
Recommendations
Cites work
- scientific article; zbMATH DE number 4154469 (Why is no real title available?)
- A larger family of planar graphs that satisfy the total coloring conjecture
- Coloring of trees with minimum sum of colors
- Edge Dominating Sets in Graphs
- On bounds for the incidentor chromatic number of a directed weighted multigraph
- On the cost chromatic number of outerplanar, planar, and line graphs
- The chromatic sum of a graph: history and recent developments
Cited in
(16)- A note on chromatic sum.
- Minimal colorings for properly colored subgraphs
- Total chromatic sum for trees
- Graphs with least number of colorings
- On the minimum sum coloring of \(P_4\)-sparse graphs
- Tight bounds on the chromatic sum of a connected graph
- On the edge-difference and edge-sum chromatic sum of the simple graphs
- scientific article; zbMATH DE number 4154469 (Why is no real title available?)
- scientific article; zbMATH DE number 861338 (Why is no real title available?)
- Coloring sums of extensions of certain graphs
- Tabular graphs and chromatic sum
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- Minimax relations for the partial q-colorings of a graph
- Colorings at minimum cost
- Coloring of trees with minimum sum of colors
- scientific article; zbMATH DE number 5904019 (Why is no real title available?)
This page was built for publication: Total colorings of graphs with minimum sum of colors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503645)
