Total chromatic sum for trees

DOI10.1007/978-3-030-63072-0_3zbMath1479.05111OpenAlexW3133984533MaRDI QIDQ2056882

Michał Małafiejski, Krzysztof M. Ocetkiewicz, Ewa M. Kubicka, Grzegorz M. Kubicki

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_3

zbMATH Keywords

treessum of colorstotal colorings

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Total colorings of graphs with minimum sum of colors
• A larger family of planar graphs that satisfy the total coloring conjecture
• 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 chromatic sum for trees