𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List 2-distance (Δ + 1)-coloring of planar graphs with given girth

✍ Scribed by O. V. Borodin; A. O. Ivanova; T. K. Neustroeva


Book ID
111471178
Publisher
Pleiades Publishing
Year
2008
Tongue
English
Weight
619 KB
Volume
2
Category
Article
ISSN
1990-4789

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