𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Injective (Δ + 1)-coloring of planar graphs with girth 6

✍ Scribed by O. V. Borodin; A. O. Ivanova


Book ID
110187450
Publisher
SP MAIK Nauka/Interperiodica
Year
2011
Tongue
English
Weight
248 KB
Volume
52
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


(2 + ?)-Coloring of planar graphs with l
✍ Klostermeyer, William; Zhang, Cun Quan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 3 views

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f ( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f ( ), then G is (2 + )-colorable. N