101 citations · 125 across the 7 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Covering the edges of a random graph by cliques
Alan Frieze, Bruce Reed
The clique cover number of a graph G is the minimum number of cliques required to cover the edges of graph G. In this paper we consider the random graph G(n,p), for p constant. We…
cs.DM2011
Asymptotics of the chromatic number for quasi-line graphs
Andrew D. King, Bruce Reed
As proved by Kahn, the chromatic number and fractional chromatic number of a line graph agree asymptotically. That is, for any line graph we have . We…