Uniquely 2-List Colorable Graphs
Combinatorics
2008-01-03 v2
Abstract
A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which characterizes uniquely 2-list colorable graphs. We introduce the uniquely list chromatic number of a graph and make a conjecture about it which is a generalization of the well known Brooks' theorem.
Cite
@article{arxiv.math/9906187,
title = {Uniquely 2-List Colorable Graphs},
author = {Y. G. Ganjali and M. Ghebleh and H. Hajiabolhassan and M. Mirzazadeh and B. S. Sadjad},
journal= {arXiv preprint arXiv:math/9906187},
year = {2008}
}