Alexandre Pinlou

From MaRDI portal
Person:317410

Available identifiers

zbMath Open pinlou.alexandreMaRDI QIDQ317410

List of research outcomes





PublicationDate of PublicationType
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree2023-07-19Paper
The chromatic number of signed graphs with bounded maximum average degree2022-05-30Paper
\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)2021-02-08Paper
On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\)2020-05-18Paper
Oriented cliques and colorings of graphs with low maximum degree2020-03-20Paper
Acyclic coloring of graphs and entropy compression method2020-02-20Paper
Homothetic triangle representations of planar graphs2019-10-25Paper
Oriented coloring of graphs with low maximum degree2019-05-29Paper
On the difference between the Szeged and the Wiener index2019-04-29Paper
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs2019-02-20Paper
Large induced forests in planar graphs with girth 42019-02-08Paper
Partitioning sparse graphs into an independent set and a forest of bounded degree2018-05-25Paper
On repetition thresholds of caterpillars and trees of bounded degree2018-05-25Paper
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree2017-09-11Paper
Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs2017-06-30Paper
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree2016-10-14Paper
A lower bound on the order of the largest induced forest in planar graphs with high girth2016-09-30Paper
Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable2016-05-24Paper
2-Distance Coloring of Sparse Graphs2014-11-17Paper
2-distance coloring of sparse graphs2014-11-17Paper
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs2014-09-19Paper
Application of entropy compression in pattern avoidance2014-09-04Paper
List coloring the square of sparse graphs with large degree2014-09-02Paper
Entropy compression method applied to graph colorings2014-06-17Paper
Locally identifying coloring in bounded expansion classes of graphs2014-04-23Paper
Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable2014-01-17Paper
Homomorphisms of signed planar graphs2014-01-14Paper
2-distance coloring of sparse graphs2013-11-01Paper
Chromatic number of sparse colored mixed planar graphs2013-10-10Paper
Spanning galaxies in digraphs2013-10-10Paper
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs2013-07-23Paper
A Complexity Dichotomy for the Coloring of Sparse Graphs2013-05-21Paper
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable2013-01-29Paper
Triangle contact representations and duality2012-08-13Paper
On spanning galaxies in digraphs2012-05-11Paper
The Domination Number of Grids2012-03-15Paper
Triangle Contact Representations and Duality2011-02-11Paper
Homomorphisms of 2-edge-colored graphs2010-08-13Paper
Oriented colorings of partial 2-trees2010-06-09Paper
Acyclic improper colourings of graphs with bounded maximum degree2010-03-29Paper
Oriented vertex and arc colorings of outerplanar graphs2010-01-29Paper
An oriented coloring of planar graphs with girth at least five2009-06-19Paper
Oriented vertex and arc colorings of partial 2-trees2008-06-05Paper
Homomorphisms of 2-edge-colored graphs2008-06-05Paper
Strong oriented chromatic number of planar graphs without cycles of specific lengths2008-06-05Paper
https://portal.mardi4nfdi.de/entity/Q53877262008-05-27Paper
On the oriented chromatic index of oriented graphs2008-05-14Paper
Acyclic improper choosability of graphs2007-05-29Paper
The acircuitic directed star arboricity of subcubic graphs is at most four2006-12-14Paper
On arc-coloring of subcubic graphs2006-08-30Paper

Research outcomes over time

This page was built for person: Alexandre Pinlou