Total colorings of graphs with minimum sum of colors
From MaRDI portal
Publication:503645
DOI10.1007/S00373-016-1720-0zbMATH Open1353.05052OpenAlexW2469089321MaRDI QIDQ503645FDOQ503645
Authors: Ewa Kubicka, Grzegorz Kubicki, Maxfield Leidner 
Publication date: 13 January 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1720-0
Recommendations
Cites Work
- A larger family of planar graphs that satisfy the total coloring conjecture
- Edge Dominating Sets in Graphs
- On bounds for the incidentor chromatic number of a directed weighted multigraph
- The chromatic sum of a graph: history and recent developments
- Title not available (Why is that?)
- On the cost chromatic number of outerplanar, planar, and line graphs
- Coloring of trees with minimum sum of colors
Cited In (16)
- Tight bounds on the chromatic sum of a connected graph
- Tabular graphs and chromatic sum
- Colorings at minimum cost
- Title not available (Why is that?)
- Minimal colorings for properly colored subgraphs
- On the minimum sum coloring of \(P_4\)-sparse graphs
- Title not available (Why is that?)
- 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
- Coloring of trees with minimum sum of colors
- On the edge-difference and edge-sum chromatic sum of the simple graphs
- A note on chromatic sum.
- Title not available (Why is that?)
- Total chromatic sum for trees
- Graphs with least number of colorings
- Coloring sums of extensions of certain graphs
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)
