𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic edge colorings of planar graphs and seriesparallel graphs

✍ Scribed by JianFeng Hou; JianLiang Wu; GuiZhen Liu; Bin Liu

Book ID
107347853
Publisher
SP Science China Press
Year
2009
Tongue
English
Weight
403 KB
Volume
52
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic colorings of planar graphs
Acyclic colorings of planar graphs
✍ Wayne Goddard πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 223 KB
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-colorings of sparse graphs
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 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