42 citations · 153 across the 70 of their papers we have counts for
4 papers · 1 filter
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…
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…
Maximum 4-degenerate subgraph of a planar graph
Robert Lukoťka, Ján Mazák, Xuding Zhu
A graph is -degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree or less. We prove that every connected planar graph with…
Regular graphs of odd degree are antimagic
Daniel W. Cranston
An antimagic labeling of a graph with edges is a bijection from to such that for all vertices and , the sum of labels on edges incident to…