Publication details
Hajos' theorem for list coloring
| Authors | |
|---|---|
| Year of publication | 2004 |
| Type | Article in Periodical |
| Magazine / Source | Discrete Mathematics |
| Citation | |
| Doi | http://dx.doi.org/10.1016/j.disc.2004.07.001 |
| Keywords | graph coloring; list coloring |
| Description | We study an analogue of Hajos' theorem for list coloring which states that each non-k-choosable graph can be obtained from any non-k-choosable complete bipartite graph by a certain set of graph operations. We show that one of the operations of the original set, namely Hajos sum, can be left out. (C) 2004 Elsevier B.V. All rights reserved. |