𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic edge coloring of sparse graphs

✍ Scribed by Yingqian Wang; Ping Sheng


Book ID
118737068
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
285 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Acyclic edge-colorings of sparse graphs
✍ Y. Caro; Y. Roditty πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 393 KB

A k-forest is a forest in which the maximum degree is k. The k-arboricity denoted Ak(G) is the minimum number of k-forests whose union is the graph G. We show that if G is an m-degenerate graph of maximum degree A, then Ak(G) 5 [(A + (k -1) m -1)/k], k 2 2, and derive several consequences of this in

Acyclic List Edge Coloring of Graphs
✍ Hsin-Hao Lai; Ko-Wei Lih πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 595 KB
Acyclic edge coloring of subcubic graphs
✍ Manu Basavaraju; L. Sunil Chandran πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 271 KB
Acyclic edge coloring of 2-degenerate gr
✍ 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
✍ 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