𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Injective colorings of planar graphs with few colors

✍ Scribed by Borut Lužar; Riste Škrekovski; Martin Tancer


Book ID
108114023
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
945 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Coloring graphs with locally few colors
✍ P Erdös; Z Füredi; A Hajnal; P Komjáth; V Rödl; Á Seress 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 832 KB

Let G be a graph, m > r t> 1 integers. Suppose that it has a good-coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2.4) states: The chromatic number of G, Chr(G) ~< r2" log21og2 m (an

Injective colorings of sparse graphs
✍ Daniel W. Cranston; Seog-Jin Kim; Gexin Yu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 338 KB