24 citations · 78 across the 21 of their papers we have counts for
Showing 2010 · math.COShow all
2 papers · 2 filters
math.CO2010★ 4 cited
Induced Subgraphs of Johnson Graphs
Ramin Naimi, Jeffrey Shaw
The Johnson graph J(n,N) is defined as the graph whose vertices are the n-subsets of the set {1,2,...,N}, where two vertices are adjacent if they share exactly n - 1 elements. Unli…
math.CO2010
List Coloring and -monophilic graphs
Radoslav Kirov, Ramin Naimi
In 1990, Kostochka and Sidorenko proposed studying the smallest number of list-colorings of a graph among all assignments of lists of a given size to its vertices. We say a…