𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The total chromatic number of pseudo-outerplanar graphs

✍ Scribed by Wang Weifan; Zhang Kemin

Book ID
107502094
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
1997
Tongue
English
Weight
404 KB
Volume
12
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Game chromatic number of outerplanar gra
Game chromatic number of outerplanar graphs
✍ Guan, D. J.; Zhu, Xuding πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs.

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 relaxed game chromatic number of out
The relaxed game chromatic number of outerplanar graphs
✍ Charles Dunn; Hal A. Kierstead πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

## Abstract The (__r__,__d__)‐relaxed coloring game is played by two players, Alice and Bob, on a graph __G__ with a set of __r__ colors. The players take turns coloring uncolored vertices with legal colors. A color Ξ± is legal for an uncolored vertex __u__ if __u__ is adjacent to at most __d__ vert