✦ LIBER ✦

n-Tuple Coloring of Planar Graphs with Large Odd Girth

✍ Scribed by William Klostermeyer; Cun Quan Zhang

Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 149 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

(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

Edge Coloring of Embedded Graphs with La

Edge Coloring of Embedded Graphs with Large Girth

✍ Xuechao Li; Rong Luo 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 255 KB

Total Colourings of Planar Graphs with L

Total Colourings of Planar Graphs with Large Girth

✍ O.V. Borodin; A.V. Kostochka; D.R. Woodall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 96 KB

It is proved that if G is a planar graph with total (vertex-edge) chromatic number χ , maximum degree and girth g, then χ = + 1 if ≥ 5 and g ≥ 5, or ≥ 4 and g ≥ 6, or ≥ 3 and g ≥ 10. These results hold also for graphs in the projective plane, torus and Klein bottle.

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

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.