๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Total coloring of planar graphs with maximum degree 8

โœ Scribed by Wang, Huijuan; Wu, Lidong; Wu, Jianliang

Book ID
122191676
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
289 KB
Volume
522
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Total colorings of planar graphs with la
Total colorings of planar graphs with large maximum degree
โœ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 97 KB ๐Ÿ‘ 3 views

It is proved that a planar graph with maximum degree โˆ† โ‰ฅ 11 has total (vertex-edge) chromatic number โˆ† + 1.

On total 9-coloring planar graphs of max
On total 9-coloring planar graphs of maximum degree seven
โœ Sanders, Daniel P.; Zhao, Yue ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 3 views

Given a graph G, a total k-coloring of G is a simultaneous coloring of the vertices and edges of G with at most k colors. If โˆ†(G) is the maximum degree of G, then no graph has a total โˆ†-coloring, but Vizing conjectured that every graph has a total (โˆ† + 2)-coloring. This Total Coloring Conjecture rem