| Girth and Circular Choosability of Series-Parallel Graphs |
| Received:March 31, 2005 |
| Key Words:
circular choosability, planar graph, girth.
|
| Fund Project:The National Natural Science Foundation of China (10471048), RFDP (20040422004) of Higher Education, Promotional Foundation (2005BS01016) for Middle-aged or Young Scientists of Shandong Province, and DRF of QFNU. |
|
| Hits: 3022 |
| Download times: 2528 |
| Abstract: |
| This paper discusses a circular version of choosability of series-parallel graphs. Let $\chi_{c,l}$ denote the circular choosability (or the circular list chromatic number). This paper proves that serial-parallel graphs of girth at least $4n+1$ have circular choosability at most $2+1/n$. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2006.03.010 |
| View Full Text View/Add Comment |
|
|
|
