The total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
Authors
- dr hab. inż. Michał Małafiejski link open in new tab ,
- dr inż. Krzysztof Ocetkiewicz link open in new tab ,
- dr Ewa Kubicka,
- dr Grzegorz Kubicki
Additional information
- Category
- Aktywność konferencyjna
- Type
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Language
- angielski
- Publication year
- 2021
Source: MOSTWiedzy.pl - publication "Total chromatic sum for trees" link open in new tab
