✦ LIBER ✦

Sub-exponentially many 3-colorings of triangle-free planar graphs

✍ Scribed by Asadi, Arash; Dvořák, Zdeněk; Postle, Luke; Thomas, Robin

Book ID: 123037111
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 211 KB
Volume: 103
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2013.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sub-Exponentially Many 3-Colorings of Tr

Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs

✍ Arash Asadi; Luke Postle; Robin Thomas 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Oriented colorings of triangle-free plan

Oriented colorings of triangle-free planar graphs

✍ Pascal Ochem 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Fast 3-coloring Triangle-Free Planar Gra

Fast 3-coloring Triangle-Free Planar Graphs

✍ Lukasz Kowalik 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 546 KB

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

Oriented Coloring of Triangle-Free Plana

Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs

✍ Pascal Ochem, Alexandre Pinlou 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 422 KB

Planar graphs without triangles adjacent

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable

✍ O.V. Borodin; A.N. Glebov; A. Raspaud 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 468 KB