𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The\(r\)-acyclic chromatic number of planar graphs

✍ Scribed by Wang, Guanghui; Yan, Guiying; Yu, Jiguo; Zhang, Xin

Book ID
120694274
Publisher
Springer US
Year
2013
Tongue
English
Weight
194 KB
Volume
29
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The star-chromatic number of planar grap
The star-chromatic number of planar graphs
✍ Moser, David πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 2 views

The star-chromatic number of a graph, a parameter introduced by Vince, is a natural generalization of the chromatic number of a graph. Here we construct planar graphs with star-chromatic number r, where r is any rational number between 2 and 3, partially answering a question of Vince.

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