Name
Abstract | ||
|---|---|---|
The partial list colouring conjecture due to Albertson, Grossman, and Haas [1] states that for every s-choosable graph G and every assignment of lists of size t, 1 <= t <= s, to the vertices of G there is an induced subgraph of G on at least t vertical bar V(G)vertical bar/S(c) vertices which can be properly coloured from these lists. In this paper, we show that the partial list colouring conjecture holds true for certain classes of graphs like claw-free graphs, graphs with chromatic number at least vertical bar V(G)vertical bar-1/1, chordless graphs, and series-parallel graphs. |
Year | Venue | DocType |
|---|---|---|
2015 | ELECTRONIC JOURNAL OF COMBINATORICS | Journal |
Volume | Issue | ISSN |
22 | 3.0 | 1077-8926 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeannette Janssen | 1 | 295 | 32.23 |
| Rogers Mathew | 2 | 89 | 14.54 |
| Deepak Rajendraprasad | 3 | 118 | 16.64 |