The list chromatic numbers of some planar graphs |
| |
| Authors: | Lü Enyue Zhang Kemin |
| |
| Institution: | (1) Dept. of Math., Nanjing Univ., 210093 Nanjing |
| |
| Abstract: | In this paper the choosability of outerplanar graphs, 1-tree and strong 1-outerplanar graphs have been described completely.
A precise upper bound of the list chromatic number of 1-outerplanar graphs is given, and that every 1-outerplanar graph with
girth at least 4 is 3-choosable is proved.
The project supported by NSFC and NSFJS |
| |
| Keywords: | 05C15 |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
|
