Pinlou, Alexandre

1. Large induced forests in planar graphs with girth 4 or 5
   2014/09/04 by Dross, François, Montassier, Mickael, Pinlou, Alexandre · 2 citations
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
2. Partitioning a triangle-free planar graph into a forest and a forest of\n bounded degree
   2016/01/07 by François Dross, Dross, François, Mickaël Montassier +3 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory
3. A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
   2017/05/31 by Dross, François, Montassier, Mickael, Pinlou, Alexandre · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
4. Entropy compression method applied to graph colorings
   2014/06/17 by Daniel Gonçalves, Gonçalves, Daniel, Mickaël Montassier +3 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications