𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List edge and list total coloring of 1-planar graphs

✍ Scribed by Xin Zhang, Jianliang Wu, Guizhen Liu

Book ID
120811858
Publisher
Higher Education Press and Springer
Year
2012
Tongue
English
Weight
170 KB
Volume
7
Category
Article
ISSN
1673-3452

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Adapted list coloring of planar graphs
Adapted list coloring of planar graphs
✍ Louis Esperet; MickaΓ«l Montassier; Xuding Zhu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 1 views

## Abstract Given an edge coloring __F__ of a graph __G__, a vertex coloring of __G__ is __adapted to F__ if no color appears at the same time on an edge and on its two endpoints. If for some integer __k__, a graph __G__ is such that given any list assignment __L__ to the vertices of __G__, with |_

Acyclic List Edge Coloring of Graphs
Acyclic List Edge Coloring of Graphs
✍ Hsin-Hao Lai; Ko-Wei Lih πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 595 KB
Acyclic list 7-coloring of planar graphs
Acyclic list 7-coloring of planar graphs
✍ O. V. Borodin; D. G. Fon-Der Flaass; A. V. Kostochka; A. Raspaud; E. Sopena πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

## Abstract The acyclic list chromatic number of every planar graph is proved to be at most 7. Β© 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002