Title of article
Hajósʹ theorem for list coloring
Author/Authors
Daniel Kr?lʹ، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
3
From page
161
To page
163
Abstract
We study an analogue of Hajósʹ 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 Hajós sum, can be left out.
Keywords
Graph coloring , List coloring
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948621
Link To Document