| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652128 | Electronic Notes in Discrete Mathematics | 2013 | 7 Pages |
Abstract
We discuss some recent results and conjectures on bounding the choice number of a graph G under the condition that |V(G)| is bounded above by a fixed function of χ(G).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
