✦ LIBER ✦

Edge Coloring of Embedded Graphs with Large Girth

✍ Scribed by Xuechao Li; Rong Luo

Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 255 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0514-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edges in graphs with large girth

✍ R. D. Dutton; R. C. Brigham 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 365 KB

UniquelyH-colorable graphs with large gi

UniquelyH-colorable graphs with large girth

✍ Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 2 views

Suppose G and H are graphs. We say G is H-colorable if there is a homomorphism (edge-preserving vertex mapping) from G to H. We say a graph G is uniquely H-colorable if there is an onto homomorphism c from G to H, and any other homomorphism from G to H is the composition o o c of c with an automorph

(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

Coloring edges of embedded graphs

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

In this paper, we prove that any graph G with maximum degree ÁG ! 11 p 49À241AEa2, which is embeddable in a surface AE of characteristic 1AE 1 and satis®es jVGj b 2ÁGÀ5À2 p 6ÁG, is class one.

Edge Colorings of Embedded Graphs

✍ Zhongde Yan; Yue Zhao 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 125 KB