𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On acyclic colorings of graphs on surfaces

✍ Scribed by Noga Alon; Bojan Mohar; Daniel P. Sanders

Book ID
112886357
Publisher
The Hebrew University Magnes Press
Year
1996
Tongue
English
Weight
485 KB
Volume
94
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On -acyclic edge colorings of planar gra
On -acyclic edge colorings of planar graphs
✍ Xin Zhang; Guanghui Wang; Yong Yu; Jinbo Li; Guizhen Liu πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 229 KB
Acyclic colorings of planar graphs
Acyclic colorings of planar graphs
✍ Branko GrΓΌnbaum πŸ“‚ Article πŸ“… 1973 πŸ› The Hebrew University Magnes Press 🌐 English βš– 762 KB
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