✦ LIBER ✦

Fast 3-coloring Triangle-Free Planar Graphs

✍ Scribed by Lukasz Kowalik

Publisher: Springer
Year: 2009
Tongue: English
Weight: 546 KB
Volume: 58
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-009-9295-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge coloring of triangle-free p

Acyclic edge coloring of triangle-free planar graphs

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB 👁 2 views

An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). It was conjectured by Al

Fast algorithms for edge-coloring planar

Fast algorithms for edge-coloring planar graphs

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

Star chromatic number of triangle-free p

Star chromatic number of triangle-free planar graphs

✍ G.-G. Gao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Large Induced Forests in Triangle-Free P

Large Induced Forests in Triangle-Free Planar Graphs

✍ Mohammad R. Salavatipour 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 178 KB

Every triangle-free planar graph has a p

Every triangle-free planar graph has a planar upward drawing

✍ Andrzej Kisielewicz; Ivan Rival 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 990 KB

3-List-Coloring Planar Graphs of Girth 5

✍ C. Thomassen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grötzsch's theorem that every planar graph of girth at least 4 is 3-colorable. If 1995 Academic Press, Inc.