✦ 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
DOI: 10.1134/s0037446606010034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

List 2-distance (Δ + 1)-coloring of plan

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

✍ O. V. Borodin; A. O. Ivanova; T. K. Neustroeva 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 619 KB

List 2-distance (Δ + 2)-coloring of plan

List 2-distance (Δ + 2)-coloring of planar graphs with girth 6 and Δ ≥ 24

✍ Oleg V. Borodin; Anna O. Ivanova 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 167 KB

List 2-distance (Δ + 1)-coloring of plan

List 2-distance (Δ + 1)-coloring of planar graphs with girth at least 7

✍ A. O. Ivanova 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 499 KB

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs with large girth

✍ Dongxiao Yu; Jianfeng Hou; Guizhen Liu; Bin Liu; Lan Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 450 KB

(2 + ?)-Coloring of planar graphs with l

(2 + ?)-Coloring of planar graphs with large odd-girth

✍ 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

n-Tuple Coloring of Planar Graphs with L

n-Tuple Coloring of Planar Graphs with Large Odd Girth

✍ William Klostermeyer; Cun Quan Zhang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 149 KB