Mickaël Montassier

Discret. Math., 2025

2023

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

[BibT_eX]

[DOI]

Discret. Math., 2023

2022

2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10.

[BibT_eX]

[DOI]

J. Comb. Optim., 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

2-distance (Δ+2)-coloring of sparse graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2-distance 4-coloring of planar subcubic graphs with girth at least 21.

[BibT_eX]

[DOI]

CoRR, 2021

2-distance (Δ+1)-coloring of sparse graphs using the potential method.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Acyclic coloring of graphs and entropy compression method.

[BibT_eX]

[DOI]

Daniel Gonçalves

Discret. 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

2018

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2016

3-path in graphs with bounded average degree.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Optimal unavoidable sets of types of 3-paths for planar graphs of given girth.

[BibT_eX]

[DOI]

Discret. Math., 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

Design of fault-tolerant on-board networks with variable switch sizes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Independent Domination in Cubic Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Near-Colorings: Non-Colorable Graphs and NP-Completeness.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Vertex Partitions of Graphs into Cographs and Stars.

[BibT_eX]

[DOI]

Paul Dorbec

J. Graph Theory, 2014

Limits of Near-Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Strong chromatic index of planar graphs with large girth.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Entropy compression method applied to graph colorings.

[BibT_eX]

[DOI]

Daniel Gonçalves

CoRR, 2014

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

Generalized Power Domination in Regular Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A Complexity Dichotomy for the Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

L(p, q)-labeling of sparse graphs.

[BibT_eX]

[DOI]

Clément Charpentier

J. Comb. Optim., 2013

On strong edge-colouring of subcubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Decomposing a graph into forests.

[BibT_eX]

[DOI]

Patrice Ossona de Mendez

J. Comb. Theory B, 2012

On backbone coloring of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Some structural properties of planar graphs and their applications to 3-choosability.

[BibT_eX]

[DOI]

Min Chen

Discret. Math., 2012

(k, 1)-coloring of sparse graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Generalized power domination of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Locally Identifying Coloring of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

Covering a Graph by Forests and a Matching.

[BibT_eX]

[DOI]

Tomás Kaiser

SIAM J. Discret. Math., 2011

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Minmax degree of graphs (Extended abstract).

[BibT_eX]

[DOI]

Clément Charpentier

Electron. Notes Discret. Math., 2011

On two variations of identifying codes.

[BibT_eX]

[DOI]

Discret. Math., 2011

(k, j)-coloring of sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Decomposition of sparse graphs into two forests, one having bounded maximum degree.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Decomposition of sparse graphs, with application to game coloring number.

[BibT_eX]

[DOI]

Discret. Math., 2010

Planar graphs without adjacent cycles of length at most seven are 3-colorable.

[BibT_eX]

[DOI]

Oleg V. Borodin

Discret. Math., 2010

A note on the acyclic 3-choosability of some planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

Adapted list coloring of planar graphs.

[BibT_eX]

[DOI]

Louis Esperet

J. Graph Theory, 2009

Star coloring of sparse graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Acyclic choosability of planar graphs: a Steinberg like approach.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

An upper bound on adaptable choosability of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

A relaxation of Havel's 3-color problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 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

Linear choosability of graphs.

[BibT_eX]

[DOI]

Louis Esperet

Discret. Math., 2008

2007

Acyclic 5-choosability of planar graphs without small cycles.

[BibT_eX]

[DOI]

Weifan Wang

J. Graph Theory, 2007

A small non-Z4-colorable planar graph.

[BibT_eX]

[DOI]

Discret. Math., 2007

(d, 1)-total labelling of planar graphs with large girth and high maximum degree.

[BibT_eX]

[DOI]

Fabrice Bazzaro

Discret. Math., 2007

2006

(d, 1)-total labeling of graphs with a given maximum average degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

On the acyclic choosability of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

A note on 2-facial coloring of plane graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

A note on the not 3-choosability of some families of planar graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Bordeaux 3-color conjecture and 3-choosability.

[BibT_eX]

[DOI]

Weifan Wang

Discret. Math., 2006

2005

Acyclic Choosability of Graphs with Small Maximum Degree.

[BibT_eX]

[DOI]

Daniel Gonçalves