𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with maximum degree 6 are acyclically 11-colorable

✍ Scribed by Hervé Hocquard

Book ID
108154773
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
177 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge coloring of graphs with max
Acyclic edge coloring of graphs with maximum degree 4
✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract 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 conj

Almost all graphs with average degree 4
Almost all graphs with average degree 4 are 3-colorable
✍ Dimitris Achlioptas; Cristopher Moore 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 323 KB

We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., Gðn; p ¼ d=nÞ; are 3-colorable and that a constant fraction of all 4-regular graphs are 3-colorable.