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

On Approximately Counting Colorings of Small Degree Graphs

โœ Scribed by Bubley, Russ; Dyer, Martin; Greenhill, Catherine; Jerrum, Mark


Book ID
118177554
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
332 KB
Volume
29
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Polychromatic colorings of bounded degre
โœ Elad Horev; Roi Krakovski ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 289 KB

## Abstract A __polychromatic k__โ€__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro

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.