Alexandre Pinlou

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 25

Top Topics

Independent Set

Top Venues

Discret. Appl. Math.

Electron. J. Comb.

Publications

Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. Discret. Math. 346 (10) (2023)
Fabien Jacques, Alexandre Pinlou
The chromatic number of signed graphs with bounded maximum average degree. Discret. Appl. Math. 316 (2022)
Fabien Jacques, Alexandre Pinlou
The chromatic number of signed graphs with bounded maximum average degree. CoRR (2021)
Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. Eur. J. Comb. 91 (2021)
Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou, Roman Soták
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. 279 (2020)
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
Acyclic coloring of graphs and entropy compression method. Discret. Math. 343 (4) (2020)
Janusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski
Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. 343 (5) (2020)
Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. CoRR (2020)
Pascal Ochem, Alexandre Pinlou
Oriented coloring of graphs with low maximum degree. CoRR (2019)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discret. Math. 342 (4) (2019)
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
Homothetic triangle representations of planar graphs. CoRR (2019)
François Dross, Mickaël Montassier, Alexandre Pinlou
Large induced forests in planar graphs with girth 4. Discret. Appl. Math. 254 (2019)
Borut Luzar, Pascal Ochem, Alexandre Pinlou
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. 25 (1) (2018)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. Electron. J. Comb. 25 (1) (2018)
Borut Luzar, Pascal Ochem, Alexandre Pinlou
On repetition thresholds of caterpillars and trees of bounded degree. CoRR (2017)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Eur. J. Comb. 66 (2017)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. CoRR (2017)
Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski
On the difference between the Szeged and the Wiener index. Appl. Math. Comput. 312 (2017)
Pascal Ochem, Alexandre Pinlou, Sagnik Sen
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory 85 (1) (2017)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. CoRR (2016)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
are minimally edge and total choosable. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced forest in planar graphs with high girth. Discret. Appl. Math. 214 (2016)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning sparse graphs into an independent set and a forest of bounded degree. CoRR (2016)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electron. Notes Discret. Math. 49 (2015)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced forest in planar graphs with high girth. CoRR (2015)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
are minimally edge and total choosable. CoRR (2014)
Pascal Ochem, Alexandre Pinlou
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs Comb. 30 (2) (2014)
Pascal Ochem, Alexandre Pinlou
Application of Entropy Compression in Pattern Avoidance. Electron. J. Comb. 21 (2) (2014)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2-Distance Coloring of Sparse Graphs. J. Graph Theory 77 (3) (2014)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
List coloring the square of sparse graphs with large degree. Eur. J. Comb. 41 (2014)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Discret. Math. 317 (2014)
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
Entropy compression method applied to graph colorings. CoRR (2014)
Pascal Ochem, Alexandre Pinlou, Sagnik Sen
Homomorphisms of signed planar graphs. CoRR (2014)
François Dross, Mickaël Montassier, Alexandre Pinlou
Large induced forests in planar graphs with girth 4 or 5. CoRR (2014)
Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
Locally identifying coloring in bounded expansion classes of graphs. Discret. Appl. Math. 161 (18) (2013)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable CoRR (2013)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
List coloring the square of sparse graphs with large degree. CoRR (2013)
Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73 (1) (2013)
Pascal Ochem, Alexandre Pinlou
Application of entropy compression in pattern avoidance CoRR (2013)
Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
Locally identifying coloring in bounded expansion classes of graphs CoRR (2012)
Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé
On spanning galaxies in digraphs. Discret. Appl. Math. 160 (6) (2012)
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
Triangle Contact Representations and Duality. Discret. Comput. Geom. 48 (1) (2012)
Pascal Ochem, Alexandre Pinlou
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electron. Notes Discret. Math. 37 (2011)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2-distance coloring of sparse graphs. Electron. Notes Discret. Math. 38 (2011)
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
The Domination Number of Grids CoRR (2011)
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
The Domination Number of Grids. SIAM J. Discret. Math. 25 (3) (2011)
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
Triangle Contact Representations and Duality. Graph Drawing (2010)
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. 158 (12) (2010)
Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou
Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. 310 (2) (2010)
Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena
Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discret. Math. 34 (2009)
Alexandre Pinlou
An oriented coloring of planar graphs with girth at least five. Discret. Math. 309 (8) (2009)
Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet
Spanning galaxies in digraphs. Electron. Notes Discret. Math. 34 (2009)
Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. 10 (1) (2008)
Pascal Ochem, Alexandre Pinlou
Oriented colorings of partial 2-trees. Inf. Process. Lett. 108 (2) (2008)
Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
Strong oriented chromatic number of planar graphs without cycles of specific lengths. Electron. Notes Discret. Math. 30 (2008)
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. 30 (2008)
Pascal Ochem, Alexandre Pinlou, Éric Sopena
On the oriented chromatic index of oriented graphs. J. Graph Theory 57 (4) (2008)
Pascal Ochem, Alexandre Pinlou
Oriented vertex and arc colorings of partial 2-trees. Electron. Notes Discret. Math. 29 (2007)
Louis Esperet, Alexandre Pinlou
Acyclic improper choosability of graphs. Electron. Notes Discret. Math. 28 (2007)
Alexandre Pinlou
On Oriented Arc-Coloring of Subcubic Graphs. Electron. J. Comb. 13 (1) (2006)
Alexandre Pinlou, Éric Sopena
The acircuitic directed star arboricity of subcubic graphs is at most four. Discret. Math. 306 (24) (2006)
Alexandre Pinlou, Éric Sopena
Oriented vertex and arc colorings of outerplanar graphs. Inf. Process. Lett. 100 (3) (2006)