115 citations · 191 across the 17 of their papers we have counts for
4 papers · 1 filter
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…
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…
Planar graphs with and no triangle adjacent to a are minimally edge and total choosable
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
For planar graphs, we consider the problems of \emph{list edge coloring} and \emph{list total coloring}. Edge coloring is the problem of coloring the edges while ensuring that two…
Homomorphisms of signed planar graphs
Pascal Ochem, Alexandre Pinlou, Sagnik Sen
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of wel…