3 citations · 3 across the 4 of their papers we have counts for
4 papers
Claw-free graphs, skeletal graphs, and a stronger conjecture on , , and
Andrew D. King, Bruce A. Reed
The second author's , , conjecture proposes that every graph satisties . In this paper we prove that the conjecture holds for all cla…
A short proof that can be bounded away from towards
Andrew D. King, Bruce A. Reed
In 1998 the second author proved that there is an such that every graph satisfies . The first author recently proved that any graph satisfyi…
Bounding the fractional chromatic number of -free graphs
Katherine Edwards, Andrew D. King
King, Lu, and Peng recently proved that for , any -free graph with maximum degree has fractional chromatic number at most unless it is isomorphi…
Covering line graphs with equivalence relations
L. Esperet, J. Gimbel, A. King
An equivalence graph is a disjoint union of cliques, and the equivalence number of a graph is the minimum number of equivalence subgraphs needed to cover the e…