Mathematics – Combinatorics
Scientific paper
1999-06-28
Discrete Appl. Math. 119 (2002), no. 3, 217--225
Mathematics
Combinatorics
Scientific paper
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.
Ganjali Y. G.
Ghebleh Mohammad
Hajiabolhassan Hossein
Mirzazadeh M.
Sadjad B. S.
No associations
LandOfFree
Uniquely 2-List Colorable Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Uniquely 2-List Colorable Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniquely 2-List Colorable Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-681606