On Oriented Arc-Coloring of Subcubic Graphs. - Alexandre Pinlou (Electron. J. Comb., 2006)

The acircuitic directed star arboricity of subcubic graphs is at most four. - Alexandre Pinlou; Éric Sopena (Discret. Math., 2006)

Oriented vertex and arc colorings of outerplanar graphs. - Alexandre Pinlou; Éric Sopena (Inf. Process. Lett., 2006)

Acyclic improper choosability of graphs. - Louis Esperet; Alexandre Pinlou (Electron. Notes Discret. Math., 2007)

Oriented vertex and arc colorings of partial 2-trees. - Pascal Ochem; Alexandre Pinlou (Electron. Notes Discret. Math., 2007)

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. - Mickaël Montassier; Pascal Ochem; Alexandre Pinlou (Discret. Math. Theor. Comput. Sci., 2008)

Strong oriented chromatic number of planar graphs without cycles of specific lengths. - Mickaël Montassier; Pascal Ochem; Alexandre Pinlou (Electron. Notes Discret. Math., 2008)

Oriented colorings of partial 2-trees. - Pascal Ochem; Alexandre Pinlou (Inf. Process. Lett., 2008)

On the oriented chromatic index of oriented graphs. - Pascal Ochem; Alexandre Pinlou; Éric Sopena (J. Graph Theory, 2008)

An oriented coloring of planar graphs with girth at least five. - Alexandre Pinlou (Discret. Math., 2009)

Chromatic number of sparse colored mixed planar graphs. - Amanda Montejano; Alexandre Pinlou; André Raspaud; Éric Sopena (Electron. Notes Discret. Math., 2009)

Homomorphisms of 2-edge-colored graphs. - Amanda Montejano; Pascal Ochem; Alexandre Pinlou; André Raspaud; Éric Sopena (Discret. Appl. Math., 2010)

Acyclic improper colourings of graphs with bounded maximum degree. - Louigi Addario-Berry; Louis Esperet; Ross J. Kang; Colin J. H. McDiarmid; Alexandre Pinlou (Discret. Math., 2010)

Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. - Pascal Ochem; Alexandre Pinlou (Electron. Notes Discret. Math., 2011)

The Domination Number of Grids. - Daniel Gonçalves 001; Alexandre Pinlou; Michaël Rao; Stéphan Thomassé (SIAM J. Discret. Math., 2011)

On spanning galaxies in digraphs. - Daniel Gonçalves 001; Frédéric Havet; Alexandre Pinlou; Stéphan Thomassé (Discret. Appl. Math., 2012)

Triangle Contact Representations and Duality. - Daniel Gonçalves 001; Benjamin Lévêque; Alexandre Pinlou (Discret. Comput. Geom., 2012)

Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (CoRR, 2013)

Locally identifying coloring in bounded expansion classes of graphs. - Daniel Gonçalves 001; Aline Parreau; Alexandre Pinlou (Discret. Appl. Math., 2013)

A Complexity Dichotomy for the Coloring of Sparse Graphs. - Louis Esperet; Mickaël Montassier; Pascal Ochem; Alexandre Pinlou (J. Graph Theory, 2013)

Some Problems in Graph Coloring: Methods, Extensions and Results. - Alexandre Pinlou (2014)

Application of Entropy Compression in Pattern Avoidance. - Pascal Ochem; Alexandre Pinlou (Electron. J. Comb., 2014)

Entropy compression method applied to graph colorings. - Daniel Gonçalves 001; Mickaël Montassier; Alexandre Pinlou (CoRR, 2014)

Planar graphs with $Δ geq 7$ and no triangle adjacent to a C4 are minimally edge and total choosable. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (CoRR, 2014)

Large induced forests in planar graphs with girth 4 or 5. - François Dross; Mickaël Montassier; Alexandre Pinlou (CoRR, 2014)

Homomorphisms of signed planar graphs. - Pascal Ochem; Alexandre Pinlou; Sagnik Sen 001 (CoRR, 2014)

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (Discret. Math., 2014)

List coloring the square of sparse graphs with large degree. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (Eur. J. Comb., 2014)

2-Distance Coloring of Sparse Graphs. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (J. Graph Theory, 2014)

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. - François Dross; Mickaël Montassier; Alexandre Pinlou (Electron. Notes Discret. Math., 2015)

A lower bound on the order of the largest induced forest in planar graphs with high girth. - François Dross; Mickaël Montassier; Alexandre Pinlou (Discret. Appl. Math., 2016)

Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (Discret. Math. Theor. Comput. Sci., 2016)

On the difference between the Szeged and the Wiener index. - Marthe Bonamy; Martin Knor; Borut Luzar; Alexandre Pinlou; Riste Skrekovski (Appl. Math. Comput., 2017)

Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. - Pascal Ochem; Alexandre Pinlou; Sagnik Sen 001 (J. Graph Theory, 2017)

Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. - François Dross; Mickaël Montassier; Alexandre Pinlou (Electron. J. Comb., 2018)

On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. - Borut Luzar; Pascal Ochem; Alexandre Pinlou (Electron. J. Comb., 2018)

Oriented coloring of graphs with low maximum degree. - Pascal Ochem; Alexandre Pinlou (CoRR, 2019)

Homothetic triangle representations of planar graphs. - Daniel Gonçalves 001; Benjamin Lévêque; Alexandre Pinlou (CoRR, 2019)

Large induced forests in planar graphs with girth 4. - François Dross; Mickaël Montassier; Alexandre Pinlou (Discret. Appl. Math., 2019)

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. - François Dross; Mickaël Montassier; Alexandre Pinlou (Discret. Math., 2019)

On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. - Borut Luzar; Martina Mockovciaková; Pascal Ochem; Alexandre Pinlou; Roman Soták (Discret. Appl. Math., 2020)

Oriented cliques and colorings of graphs with low maximum degree. - Janusz Dybizbanski; Pascal Ochem; Alexandre Pinlou; Andrzej Szepietowski (Discret. Math., 2020)

Acyclic coloring of graphs and entropy compression method. - Daniel Gonçalves 001; Mickaël Montassier; Alexandre Pinlou (Discret. Math., 2020)

r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. - Hoang La; Mickaël Montassier; Alexandre Pinlou; Petru Valicov (Eur. J. Comb., 2021)

The chromatic number of signed graphs with bounded maximum average degree. - Fabien Jacques; Alexandre Pinlou (Discret. Appl. Math., 2022)

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. - Christopher Duffy 001; Fabien Jacques; Mickaël Montassier; Alexandre Pinlou (Discret. Math., 2023)