✦ LIBER ✦

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

✍ Scribed by Richard Cole; Łukasz Kowalik

Publisher: Springer
Year: 2007
Tongue: English
Weight: 457 KB
Volume: 50
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9044-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithms for edge-coloring planar

Fast algorithms for edge-coloring planar graphs

✍ Marek Chrobak; Moti Yung 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 963 KB

Improved edge-coloring algorithms for pl

Improved edge-coloring algorithms for planar graphs

✍ Marek Chrobak; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 808 KB

A linear-time algorithm for edge-disjoin

A linear-time algorithm for edge-disjoint paths in planar graphs

✍ Dorothea Wagner; Karsten Weihe 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 1007 KB

A linear 5-coloring algorithm of planar

A linear 5-coloring algorithm of planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 526 KB

Analysis of approximate algorithms for e

Analysis of approximate algorithms for edge-coloring bipartite graphs

✍ Ravi Jain; John Werth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB

4-edge-coloring graphs of maximum degree

4-edge-coloring graphs of maximum degree 3 in linear time

✍ San Skulrattanakulchai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 65 KB

We present a linear time algorithm to properly color the edges of any graph of maximum degree 3 using 4 colors. Our algorithm uses a greedy approach and utilizes a new structure theorem for such graphs.