✦ LIBER ✦

Acyclic list edge coloring of outerplanar graphs

✍ Scribed by Qiaojun Shu; Yiqiao Wang; Weifan Wang

Book ID: 119227566
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 282 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.10.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic List Edge Coloring of Graphs

✍ Hsin-Hao Lai; Ko-Wei Lih 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 595 KB

On list-coloring outerplanar graphs

✍ Joan P. Hutchinson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors __L__ (__v__ ) for each vertex __v__ such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be __L__‐list‐colored (except when

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

Efficient Vertex- and Edge-Coloring of O

Efficient Vertex- and Edge-Coloring of Outerplanar Graphs

✍ Proskurowski, Andrzej; Sysło, Maciej M. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics ⚖ 780 KB

Acyclic edge coloring of subcubic graphs

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 271 KB

Acyclic edge coloring of sparse graphs

✍ Yingqian Wang; Ping Sheng 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 285 KB