Jonathan A. Noel

activity

20122026

most citedNon-bipartite k-common graphs

8 citations · 61 across the 28 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond

Jonathan A. Noel

The \emph{choice number} of a graph $G$ , denoted $ch (G)$ , is the minimum integer $k$ such that for any assignment of lists of size $k$ to the vertices of $G$ , there is a proper co…

math.CO2013★ 7 cited

Beyond Ohba's Conjecture: A bound on the choice number of $k$ -chromatic graphs with $n$ vertices

Jonathan A. Noel, Douglas B. West, Hehui Wu +1

Let $ch (G)$ denote the choice number of a graph $G$ (also called "list chromatic number" or "choosability" of $G$ ). Noel, Reed, and Wu proved the conjecture of Ohba that $\t…

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices

Beyond Ohba's Conjecture: A bound on the choice number of $k$ -chromatic graphs with $n$ vertices