37 citations · 50 across the 12 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014★ 8 cited
Large induced forests in planar graphs with girth 4 or 5
François Dross, Mickael Montassier, Alexandre Pinlou
We give here some new lower bounds on the order of a largest induced forest in planar graphs with girth and . In particular we prove that a triangle-free planar graph of ord…
cs.DM2014★ 37 cited
Entropy compression method applied to graph colorings
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
Based on the algorithmic proof of Lovász local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmović et al. on colorings, Esperet and Parreau developed…