Acyclic Choosability of Graphs with Small Maximum Degree. - Daniel Gonçalves 001; Mickaël Montassier (WG, 2005)

Bordeaux 3-color conjecture and 3-choosability. - Mickaël Montassier; André Raspaud; Weifan Wang 001 (Discret. Math., 2006)

A note on the not 3-choosability of some families of planar graphs. - Mickaël Montassier (Inf. Process. Lett., 2006)

A note on 2-facial coloring of plane graphs. - Mickaël Montassier; André Raspaud (Inf. Process. Lett., 2006)

On the acyclic choosability of graphs. - Mickaël Montassier; Pascal Ochem; André Raspaud (J. Graph Theory, 2006)

(d, 1)-total labeling of graphs with a given maximum average degree. - Mickaël Montassier; André Raspaud (J. Graph Theory, 2006)

(d, 1)-total labelling of planar graphs with large girth and high maximum degree. - Fabrice Bazzaro; Mickaël Montassier; André Raspaud (Discret. Math., 2007)

A small non-Z4-colorable planar graph. - Mickaël Montassier (Discret. Math., 2007)

Acyclic 5-choosability of planar graphs without small cycles. - Mickaël Montassier; André Raspaud; Weifan Wang 001 (J. Graph Theory, 2007)

Linear choosability of graphs. - Louis Esperet; Mickaël Montassier; André Raspaud (Discret. Math., 2008)

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)

A relaxation of Havel's 3-color problem. - Mickaël Montassier; André Raspaud; Weifan Wang 001; Yingqian Wang 001 (Inf. Process. Lett., 2008)

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. - Huajing Lu; Yingqian Wang 001; Weifan Wang 001; Yuehua Bu; Mickaël Montassier; André Raspaud (Discret. Math., 2009)

An upper bound on adaptable choosability of graphs. - Mickaël Montassier; André Raspaud; Xuding Zhu (Eur. J. Comb., 2009)

Acyclic choosability of planar graphs: a Steinberg like approach. - Hervé Hocquard; Mickaël Montassier (Electron. Notes Discret. Math., 2009)

Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. - Hervé Hocquard; Mickaël Montassier (Inf. Process. Lett., 2009)

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov; Mickaël Montassier; André Raspaud (J. Comb. Theory B, 2009)

Star coloring of sparse graphs. - Yuehua Bu; Daniel W. Cranston; Mickaël Montassier; André Raspaud; Weifan Wang 001 (J. Graph Theory, 2009)

Adapted list coloring of planar graphs. - Louis Esperet; Mickaël Montassier; Xuding Zhu (J. Graph Theory, 2009)

A note on the acyclic 3-choosability of some planar graphs. - Hervé Hocquard; Mickaël Montassier; André Raspaud (Discret. Appl. Math., 2010)

Planar graphs without adjacent cycles of length at most seven are 3-colorable. - Oleg V. Borodin; Mickaël Montassier; André Raspaud (Discret. Math., 2010)

Decomposition of sparse graphs, with application to game coloring number. - Mickaël Montassier; Arnaud Pêcher; André Raspaud; Douglas B. West; Xuding Zhu (Discret. Math., 2010)

Decomposition of sparse graphs into two forests, one having bounded maximum degree. - Mickaël Montassier; André Raspaud; Xuding Zhu (Inf. Process. Lett., 2010)

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; Pascal Ochem; André Raspaud (J. Graph Theory, 2010)

(k, j)-coloring of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; André Raspaud (Discret. Appl. Math., 2011)

On two variations of identifying codes. - Olivier Delmas; Sylvain Gravier; Mickaël Montassier; Aline Parreau (Discret. Math., 2011)

Minmax degree of graphs (Extended abstract). - Clément Charpentier; Mickaël Montassier; André Raspaud (Electron. Notes Discret. Math., 2011)

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. - Hervé Hocquard; Mickaël Montassier (Electron. Notes Discret. Math., 2011)

Covering a Graph by Forests and a Matching. - Tomás Kaiser; Mickaël Montassier; André Raspaud (SIAM J. Discret. Math., 2011)

Locally Identifying Coloring of Graphs. - Louis Esperet; Sylvain Gravier; Mickaël Montassier; Pascal Ochem; Aline Parreau (Electron. J. Comb., 2012)

Generalized power domination of graphs. - Gerard Jennhwa Chang; Paul Dorbec; Mickaël Montassier; André Raspaud (Discret. Appl. Math., 2012)

(k, 1)-coloring of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; André Raspaud (Discret. Math., 2012)

Some structural properties of planar graphs and their applications to 3-choosability. - Min Chen 012; Mickaël Montassier; André Raspaud (Discret. Math., 2012)

On backbone coloring of graphs. - Weifan Wang 001; Yuehua Bu; Mickaël Montassier; André Raspaud (J. Comb. Optim., 2012)

Decomposing a graph into forests. - Mickaël Montassier; Patrice Ossona de Mendez; André Raspaud; Xuding Zhu (J. Comb. Theory B, 2012)

On strong edge-colouring of subcubic graphs. - Hervé Hocquard; Mickaël Montassier; André Raspaud; Petru Valicov (Discret. Appl. Math., 2013)

L(p, q)-labeling of sparse graphs. - Clément Charpentier; Mickaël Montassier; André Raspaud (J. Comb. Optim., 2013)

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ. - Hervé Hocquard; Mickaël Montassier (J. Comb. Optim., 2013)

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

Generalized Power Domination in Regular Graphs. - Paul Dorbec; Michael A. Henning; Christian Löwenstein; Mickaël Montassier; André Raspaud (SIAM J. Discret. Math., 2013)

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. - Steven Chaplick; Paul Dorbec; Jan Kratochvíl; Mickaël Montassier; Juraj Stacho (WG, 2014)

Entropy compression method applied to graph colorings. - Daniel Gonçalves 001; Mickaël Montassier; 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)

Strong chromatic index of planar graphs with large girth. - Gerard Jennhwa Chang; Mickaël Montassier; Arnaud Pêcher; André Raspaud (Discuss. Math. Graph Theory, 2014)

Limits of Near-Coloring of Sparse Graphs. - Paul Dorbec; Tomás Kaiser; Mickaël Montassier; André Raspaud (J. Graph Theory, 2014)

Vertex Partitions of Graphs into Cographs and Stars. - Paul Dorbec; Mickaël Montassier; Pascal Ochem (J. Graph Theory, 2014)

Near-Colorings: Non-Colorable Graphs and NP-Completeness. - Mickaël Montassier; Pascal Ochem (Electron. J. Comb., 2015)

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)

Independent Domination in Cubic Graphs. - Paul Dorbec; Michael A. Henning; Mickaël Montassier; Justin Southey (J. Graph Theory, 2015)

Design of fault-tolerant on-board networks with variable switch sizes. - Olivier Delmas; Frédéric Havet; Mickaël Montassier; Stéphane Pérennes (Theor. Comput. Sci., 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)

Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. - Stanislav Jendrol'; Mária Maceková; Mickaël Montassier; Roman Soták (Discret. Math., 2016)

3-path in graphs with bounded average degree. - Stanislav Jendrol'; Mária Maceková; Mickaël Montassier; Roman Soták (Discuss. Math. Graph Theory, 2016)

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)

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)

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

2-distance (Δ+1)-coloring of sparse graphs using the potential method. - Hoang La; Mickaël Montassier (CoRR, 2021)

2-distance 4-coloring of planar subcubic graphs with girth at least 21. - Hoang La; Mickaël Montassier (CoRR, 2021)

2-distance (Δ+2)-coloring of sparse graphs. - Hoang La; Mickaël Montassier (CoRR, 2021)

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)

2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10. - Hoang La; Mickaël Montassier (J. Comb. Optim., 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)

2-Distance (Δ + 1)-coloring of sparse graphs using the potential method. - Hoang La; Mickaël Montassier (Discret. Math., 2025)