Autor:	Krzysztof M. Ocetkiewicz, Michał Małafiejski, Grzegorz Kubicki, Ewa Kubicka
Rok vydání:	2020
Předmět:	Combinatorics Mathematics::Combinatorics Conjecture Chromatic sum Graph (abstract data type) Natural number Chromatic scale Mathematics
Zdroj:	AIRO Springer Series ISBN: 9783030630713
DOI:	10.1007/978-3-030-63072-0_3
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::10ba75d7ef2c1c199781cceb559dc9a5 https://doi.org/10.1007/978-3-030-63072-0_3 Zobrazit plný text záznamu