𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic edge coloring of subcubic graphs

✍ Scribed by Manu Basavaraju; L. Sunil Chandran

Book ID
108113980
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
271 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge colorings of graphs
Acyclic edge colorings of graphs
✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_

Acyclic edge coloring of 2-degenerate gr
Acyclic edge coloring of 2-degenerate graphs
✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 280 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__). A graph is

Optimal acyclic edge-coloring of cubic g
Optimal acyclic edge-coloring of cubic graphs
✍ Lars Døvling Andersen; Edita Máčajová;; Ján Mazák 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

An __acyclic edge‐coloring__ of a graph is a proper edge‐coloring such that the subgraph induced by the edges of any two colors is acyclic. The __acyclic chromatic index__ of a graph __G__ is the smallest number of colors in an acyclic edge‐coloring of __G__. We prove that the acyclic chromatic inde

6-Star-Coloring of Subcubic Graphs
6-Star-Coloring of Subcubic Graphs
✍ Min Chen; André Raspaud; Weifan Wang 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 664 KB