24 citations · 69 across the 22 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond
Jonathan A. Noel
The \emph{choice number} of a graph , denoted , is the minimum integer such that for any assignment of lists of size to the vertices of , there is a proper co…
math.CO2013★ 7 cited
Beyond Ohba's Conjecture: A bound on the choice number of -chromatic graphs with vertices
Jonathan A. Noel, Douglas B. West, Hehui Wu +1
Let denote the choice number of a graph (also called "list chromatic number" or "choosability" of ). Noel, Reed, and Wu proved the conjecture of Ohba that $\t…