9 citations · 21 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2011★ 9 cited
On the number of outer connected dominating sets of graphs
Saeid Alikhani, Mohammad H. Akhbari, C. Eslahchi +1
Let be a simple graph. A set is called an outer-connected dominating set (or ocd-set) of , if is a dominating set of and either or $…
math.CO1999★ 8 cited
Some concepts in list coloring
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…