Alexandre Pinlou

According to our database1, Alexandre Pinlou authored at least 45 papers between 2006 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9.
Eur. J. Comb., 2021

2020
Acyclic coloring of graphs and entropy compression method.
Discret. Math., 2020

Oriented cliques and colorings of graphs with low maximum degree.
Discret. Math., 2020

On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}.
Discret. Appl. Math., 2020

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree.
CoRR, 2020

2019
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs.
Discret. Math., 2019

Large induced forests in planar graphs with girth 4.
Discret. Appl. Math., 2019

Homothetic triangle representations of planar graphs.
CoRR, 2019

Oriented coloring of graphs with low maximum degree.
CoRR, 2019

2018
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree.
Electron. J. Comb., 2018

Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree.
Electron. J. Comb., 2018

2017
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs.
J. Graph Theory, 2017

On the difference between the Szeged and the Wiener index.
Appl. Math. Comput., 2017

2016
Planar graphs with Δ≥7 and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable.
Discret. Math. Theor. Comput. Sci., 2016

A lower bound on the order of the largest induced forest in planar graphs with high girth.
Discret. Appl. Math., 2016

2015
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.
Electron. Notes Discret. Math., 2015

2014
List coloring the square of sparse graphs with large degree.
Eur. J. Comb., 2014

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable.
Discret. Math., 2014

Homomorphisms of signed planar graphs.
CoRR, 2014

Large induced forests in planar graphs with girth 4 or 5.
CoRR, 2014

Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable.
CoRR, 2014

Entropy compression method applied to graph colorings.
CoRR, 2014

Application of Entropy Compression in Pattern Avoidance.
Electron. J. Comb., 2014

Some Problems in Graph Coloring: Methods, Extensions and Results.
, 2014

2013
A Complexity Dichotomy for the Coloring of Sparse Graphs.
J. Graph Theory, 2013

Locally identifying coloring in bounded expansion classes of graphs.
Discret. Appl. Math., 2013

Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
CoRR, 2013

2012
Triangle Contact Representations and Duality.
Discret. Comput. Geom., 2012

2011
The Domination Number of Grids.
SIAM J. Discret. Math., 2011

Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs.
Electron. Notes Discret. Math., 2011

2-distance coloring of sparse graphs.
Electron. Notes Discret. Math., 2011

2010
Acyclic improper colourings of graphs with bounded maximum degree.
Discret. Math., 2010

2009
Chromatic number of sparse colored mixed planar graphs.
Electron. Notes Discret. Math., 2009

Spanning galaxies in digraphs.
Electron. Notes Discret. Math., 2009

An oriented coloring of planar graphs with girth at least five.
Discret. Math., 2009

2008
On the oriented chromatic index of oriented graphs.
J. Graph Theory, 2008

Oriented colorings of partial 2-trees.
Inf. Process. Lett., 2008

Homomorphisms of 2-edge-colored graphs.
Electron. Notes Discret. Math., 2008

Strong oriented chromatic number of planar graphs without cycles of specific lengths.
Electron. Notes Discret. Math., 2008

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.
Discret. Math. Theor. Comput. Sci., 2008

2007
Oriented vertex and arc colorings of partial 2-trees.
Electron. Notes Discret. Math., 2007

Acyclic improper choosability of graphs.
Electron. Notes Discret. Math., 2007

2006
Oriented vertex and arc colorings of outerplanar graphs.
Inf. Process. Lett., 2006

The acircuitic directed star arboricity of subcubic graphs is at most four.
Discret. Math., 2006

On Oriented Arc-Coloring of Subcubic Graphs.
Electron. J. Comb., 2006


  Loading...