𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterizing acyclic graphs by labeling edges

✍ Scribed by Urrutia, Sebastián; Lucena, Abilio

Book ID
121243640
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
326 KB
Volume
164
Category
Article
ISSN
0166-218X

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-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