9 citations · 21 across the 5 of their papers we have counts for
1 paper · 1 filter
Ch. Eslahchi, M. Ghebleh, H. Hajiabolhassan
In this paper uniquely list colorable graphs are studied. A graph G is called to be uniquely k-list colorable if it admits a k-list assignment from which G has a unique list colori…