𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Injective Colorings of Graphs with Low Average Degree

✍ Scribed by Daniel W. Cranston; Seog-Jin Kim; Gexin Yu

Book ID
106149130
Publisher
Springer
Year
2010
Tongue
English
Weight
554 KB
Volume
60
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Injective colorings of sparse graphs
Injective colorings of sparse graphs
✍ Daniel W. Cranston; Seog-Jin Kim; Gexin Yu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 338 KB
Almost all graphs with average degree 4
Almost all graphs with average degree 4 are 3-colorable
✍ Dimitris Achlioptas; Cristopher Moore πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 323 KB

We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., Gðn; p ¼ d=nÞ; are 3-colorable and that a constant fraction of all 4-regular graphs are 3-colorable.

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.

Polychromatic colorings of bounded degre
Polychromatic colorings of bounded degree plane graphs
✍ 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