Alexandre Pinlou

Discret. Appl. Math., 2022

2021

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

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

2020

Acyclic coloring of graphs and entropy compression method.

[BibT_eX]

[DOI]

Discret. Math., 2020

Oriented cliques and colorings of graphs with low maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2020

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

[BibT_eX]

[DOI]

Borut Luzar

Martina Mockovciaková

Roman Soták

Discret. Appl. Math., 2020

2019

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

[BibT_eX]

[DOI]

Discret. Math., 2019

Large induced forests in planar graphs with girth 4.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Homothetic triangle representations of planar graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Oriented coloring of graphs with low maximum degree.

[BibT_eX]

[DOI]

CoRR, 2019

2018

On Repetition Thresholds of Caterpillars and Trees of Bounded Degree.

[BibT_eX]

[DOI]

Borut Luzar

Electron. J. Comb., 2018

Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs.

[BibT_eX]

[DOI]

Sagnik Sen

J. Graph Theory, 2017

On the difference between the Szeged and the Wiener index.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

A lower bound on the order of the largest induced forest in planar graphs with high girth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

List coloring the square of sparse graphs with large degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

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

[BibT_eX]

[DOI]

Discret. Math., 2014

Homomorphisms of signed planar graphs.

[BibT_eX]

[DOI]

Sagnik Sen

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Entropy compression method applied to graph colorings.

[BibT_eX]

[DOI]

CoRR, 2014

Application of Entropy Compression in Pattern Avoidance.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

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

[BibT_eX]

[DOI]

, 2014

2013

A Complexity Dichotomy for the Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Locally identifying coloring in bounded expansion classes of graphs.

[BibT_eX]

[DOI]

Aline Parreau

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

[BibT_eX]

[DOI]

CoRR, 2013

2012

Triangle Contact Representations and Duality.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

2011

The Domination Number of Grids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2-distance coloring of sparse graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Acyclic improper colourings of graphs with bounded maximum degree.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Louis Esperet

Ross J. Kang

Colin J. H. McDiarmid

Discret. Math., 2010

2009

Chromatic number of sparse colored mixed planar graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Spanning galaxies in digraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

An oriented coloring of planar graphs with girth at least five.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

On the oriented chromatic index of oriented graphs.

[BibT_eX]

[DOI]

Éric Sopena

J. Graph Theory, 2008

Oriented colorings of partial 2-trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Homomorphisms of 2-edge-colored graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Strong oriented chromatic number of planar graphs without cycles of specific lengths.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

2007

Oriented vertex and arc colorings of partial 2-trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Acyclic improper choosability of graphs.

[BibT_eX]

[DOI]

Louis Esperet

Electron. Notes Discret. Math., 2007

2006

Oriented vertex and arc colorings of outerplanar graphs.

[BibT_eX]

[DOI]

Éric Sopena

Inf. Process. Lett., 2006

The acircuitic directed star arboricity of subcubic graphs is at most four.

[BibT_eX]

[DOI]

Éric Sopena

Discret. Math., 2006

On Oriented Arc-Coloring of Subcubic Graphs.

[BibT_eX]

[DOI]