✦ LIBER ✦

Injective coloring of planar graphs with girth 6

✍ Scribed by Dong, Wei; Lin, Wensong

Book ID: 122565398
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 470 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.02.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Injective (Δ + 1)-coloring of planar gra

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

✍ O. V. Borodin; A. O. Ivanova 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 248 KB

List injective coloring of planar graphs

List injective coloring of planar graphs with girth 5, 6, 8

✍ Bu, Yuehua; Lu, Kai 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Injective coloring of plane graphs with

Injective coloring of plane graphs with girth 5

✍ Dong, Wei; Lin, Wensong 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 401 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

On linear coloring of planar graphs with

On linear coloring of planar graphs with small girth

✍ Dong, Wei; Lin, Wensong 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 461 KB