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

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles

โœ Scribed by Lan Shen; Yingqian Wang; Weifan Wang; Ko-Wei Lih

Book ID
108052470
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
638 KB
Volume
22
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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