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

Equitable colorings of planar graphs with maximum degree at least nine

โœ Scribed by Kittikorn Nakprasit


Book ID
113567506
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
215 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Total colorings of planar graphs with la
โœ 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.

Equitable list-coloring for graphs of ma
โœ Michael J. Pelsmajer ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 102 KB

## Abstract Given lists of available colors assigned to the vertices of a graph __G__, a list coloring is a proper coloring of __G__ such that the color on each vertex is chosen from its list. If the lists all have size __k__, then a list coloring is equitable if each color appears on at most โŒˆ|__V