60 citations · 106 across the 13 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.CO2010★ 60 cited
Exponentially many perfect matchings in cubic graphs
Louis Esperet, Frantisek Kardos, Andrew King +2
We show that every cubic bridgeless graph G has at least 2^(|V(G)|/3656) perfect matchings. This confirms an old conjecture of Lovasz and Plummer. This version of the paper uses a…
cs.DM2010
A stronger result on fractional strong colourings
Andrew D. King
Aharoni, Berger and Ziv recently proved the fractional relaxation of the strong colouring conjecture. In this note we generalize their result as follows. Let and partitio…
math.CO2010★ 3 cited
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…