11 citations · 14 across the 9 of their papers we have counts for
Showing 1999Show all
2 papers · 1 filter
math.CO1999★ 11 cited
On uniquely list colorable graphs
M. Ghebleh, E. S. Mahmoodian
Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors L(v), such that there is a unique proper coloring for G from this collecti…
math.CO1999
Uniquely 2-List Colorable Graphs
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…