1 paper
Y. G. Ganjali, M. Ghebleh, H. Hajiabolhassan +2
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…