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 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. ? 2002 Elsevier Science B.V. All rights reserved.

• Type: Journal
• Year: 2002
• Where: DAM
• Authors: Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabolhassan, M. Mirzazadeh, Sayyed Bashir Sadjad
• Keywords: Colorable Graphs, DAM 2002, Study Uniquely List, Uniquely List