Tight bounds on the chromatic sum of a connected graph
From MaRDI portal
Publication:3832591
DOI10.1002/jgt.3190130310zbMath0677.05028WikidataQ34692312 ScholiaQ34692312MaRDI QIDQ3832591
Carsten Thomassen, Allen J. Schwenk, Paul Erdős, Yousef Alavi, Paresh J. Malde
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130310
05C15: Coloring of graphs and hypergraphs
Related Items