𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic chromatic indices of fully subdivided graphs

✍ Scribed by Anna Fiedorowicz; Mariusz Hałuszczak

Book ID
113663366
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
161 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic and oriented chromatic numbers o
Acyclic and oriented chromatic numbers of graphs
✍ Kostochka, A. V.; Sopena, E.; Zhu, X. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

The oriented chromatic number χ o ( G) of an oriented graph G = (V, A) is the minimum number of vertices in an oriented graph H for which there exists a homomorphism of G to H. The oriented chromatic number χ o (G) of an undirected graph G is the maximum of the oriented chromatic numbers of all the

Acyclic edge chromatic number of outerpl
Acyclic edge chromatic number of outerplanar graphs
✍ Jian-Feng Hou; Jian-Liang Wu; Gui-Zhen Liu; Bin Liu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

## Abstract A proper edge coloring 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 χ(__G__), is the least number of colors in an acyclic edge coloring of __G__. In this paper, we determine completely the acyclic edge