| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653891 | European Journal of Combinatorics | 2012 | 12 Pages |
Abstract
A graph is on-line chromatic choosable if its on-line choice number equals its chromatic number. In this paper, we consider on-line chromatic-choosable complete multi-partite graphs. Assume GG is a complete kk-partite graph. It is known that if the polynomial P(G)P(G) defined as P(G)=∏u
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu,