Total colorings of graphs with minimum sum of colors

DOI10.1007/s00373-016-1720-0zbMath1353.05052OpenAlexW2469089321MaRDI QIDQ503645

Maxfield Leidner, Grzegorz M. Kubicki, Ewa M. Kubicka

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

zbMATH Keywords

total chromatic numbertotal coloringsum of colors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Total chromatic sum for trees

Cites Work

• A larger family of planar graphs that satisfy the total coloring conjecture
• The chromatic sum of a graph: history and recent developments
• Edge Dominating Sets in Graphs
• On the cost chromatic number of outerplanar, planar, and line graphs
• Coloring of trees with minimum sum of colors
• Unnamed Item
• Unnamed Item

This page was built for publication: Total colorings of graphs with minimum sum of colors