𝔖 Bobbio Scriptorium
✦   LIBER   ✦

About acyclic edge colourings of planar graphs

✍ Scribed by Anna Fiedorowicz; Mariusz Hałuszczak; Narayanan Narayanan

Book ID
108154584
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
180 KB
Volume
108
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

List colourings of planar graphs
List colourings of planar graphs
✍ Margit Voigt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 259 KB

A graph G = G( V, E) is called L-list colourable if there is a vertex colouring of G in which the colour assigned to a vertex u is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(u) have the cardinality k and G is L-list colourable for all possible assignm

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