Uniquely 2-list colorable graphs
A graph is said 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 i...
Saved in:
Published in | Discrete Applied Mathematics Vol. 119; no. 3; pp. 217 - 225 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Lausanne
Elsevier B.V
15.07.2002
Amsterdam Elsevier New York, NY |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A graph is said 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. |
---|---|
ISSN: | 0166-218X 1872-6771 |
DOI: | 10.1016/S0166-218X(00)00335-8 |