Mickaël Montassier

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 19

Top Topics

Gaussian Graphical Models

Independent Set

Top Venues

J. Graph Theory

J. Comb. Optim.

Publications

Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. Discret. Math. 346 (10) (2023)
Hoang La, Mickaël Montassier
2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10. J. Comb. Optim. 44 (2) (2022)
Hoang La, Mickaël Montassier
2-distance (Δ+2)-coloring of sparse graphs. CoRR (2021)
Hoang La, Mickaël Montassier
2-distance 4-coloring of planar subcubic graphs with girth at least 21. CoRR (2021)
Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. Eur. J. Comb. 91 (2021)
Hoang La, Mickaël Montassier
$2$-distance list $(Δ+2)$-coloring of planar graphs with girth at least 10. CoRR (2021)
Hoang La, Mickaël Montassier
2-distance (Δ+1)-coloring of sparse graphs using the potential method. CoRR (2021)
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
Acyclic coloring of graphs and entropy compression method. Discret. Math. 343 (4) (2020)
Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. CoRR (2020)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discret. Math. 342 (4) (2019)
François Dross, Mickaël Montassier, Alexandre Pinlou
Large induced forests in planar graphs with girth 4. Discret. Appl. Math. 254 (2019)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. Electron. J. Comb. 25 (1) (2018)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Eur. J. Comb. 66 (2017)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. CoRR (2017)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. CoRR (2016)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced forest in planar graphs with high girth. Discret. Appl. Math. 214 (2016)
Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Discret. Math. 339 (2) (2016)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning sparse graphs into an independent set and a forest of bounded degree. CoRR (2016)
Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták
3-path in graphs with bounded average degree. Discuss. Math. Graph Theory 36 (2) (2016)
Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes
Design of fault-tolerant on-board networks with variable switch sizes. Theor. Comput. Sci. 562 (2015)
Paul Dorbec, Michael A. Henning, Mickaël Montassier, Justin Southey
Independent Domination in Cubic Graphs. J. Graph Theory 80 (4) (2015)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electron. Notes Discret. Math. 49 (2015)
Mickaël Montassier, Pascal Ochem
Near-Colorings: Non-Colorable Graphs and NP-Completeness. Electron. J. Comb. 22 (1) (2015)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced forest in planar graphs with high girth. CoRR (2015)
Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud
Strong chromatic index of planar graphs with large girth. Discuss. Math. Graph Theory 34 (4) (2014)
Paul Dorbec, Mickaël Montassier, Pascal Ochem
Vertex Partitions of Graphs into Cographs and Stars. J. Graph Theory 75 (1) (2014)
Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. WG (2014)
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
Entropy compression method applied to graph colorings. CoRR (2014)
Paul Dorbec, Tomás Kaiser, Mickaël Montassier, André Raspaud
Limits of Near-Coloring of Sparse Graphs. J. Graph Theory 75 (2) (2014)
François Dross, Mickaël Montassier, Alexandre Pinlou
Large induced forests in planar graphs with girth 4 or 5. CoRR (2014)
Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161 (16-17) (2013)
Paul Dorbec, Michael A. Henning, Christian Löwenstein, Mickaël Montassier, André Raspaud
Generalized Power Domination in Regular Graphs. SIAM J. Discret. Math. 27 (3) (2013)
Clément Charpentier, Mickaël Montassier, André Raspaud
L(p, q)-labeling of sparse graphs. J. Comb. Optim. 25 (4) (2013)
Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73 (1) (2013)
Hervé Hocquard, Mickaël Montassier
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ. J. Comb. Optim. 26 (1) (2013)
Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud
Generalized power domination of graphs. Discret. Appl. Math. 160 (12) (2012)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally Identifying Coloring of Graphs. Electron. J. Comb. 19 (2) (2012)
Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
On backbone coloring of graphs. J. Comb. Optim. 23 (1) (2012)
Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu
Decomposing a graph into forests. J. Comb. Theory, Ser. B 102 (1) (2012)
Min Chen, Mickaël Montassier, André Raspaud
Some structural properties of planar graphs and their applications to 3-choosability. Discret. Math. 312 (2) (2012)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
(k, 1)-coloring of sparse graphs. Discret. Math. 312 (6) (2012)
Clément Charpentier, Mickaël Montassier, André Raspaud
Minmax degree of graphs (Extended abstract). Electron. Notes Discret. Math. 38 (2011)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
(k, j)-coloring of sparse graphs. Discret. Appl. Math. 159 (17) (2011)
Hervé Hocquard, Mickaël Montassier
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Electron. Notes Discret. Math. 38 (2011)
Tomás Kaiser, Mickaël Montassier, André Raspaud
Covering a Graph by Forests and a Matching. SIAM J. Discret. Math. 25 (4) (2011)
Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau
On two variations of identifying codes. Discret. Math. 311 (17) (2011)
Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau
On two variations of identifying codes CoRR (2010)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally identifying coloring of graphs CoRR (2010)
Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu
Decomposition of sparse graphs, with application to game coloring number. Discret. Math. 310 (10-11) (2010)
Mickaël Montassier, André Raspaud, Xuding Zhu
Decomposition of sparse graphs into two forests, one having bounded maximum degree. Inf. Process. Lett. 110 (20) (2010)
Hervé Hocquard, Mickaël Montassier, André Raspaud
A note on the acyclic 3-choosability of some planar graphs. Discret. Appl. Math. 158 (10) (2010)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud
. J. Graph Theory 65 (2) (2010)
Oleg V. Borodin, Mickaël Montassier, André Raspaud
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discret. Math. 310 (1) (2010)
Hervé Hocquard, Mickaël Montassier
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Inf. Process. Lett. 109 (21-22) (2009)
Hervé Hocquard, Mickaël Montassier
Acyclic choosability of planar graphs: a Steinberg like approach. Electron. Notes Discret. Math. 34 (2009)
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang
Star coloring of sparse graphs. J. Graph Theory 62 (3) (2009)
Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. J. Comb. Theory, Ser. B 99 (4) (2009)
Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discret. Math. 309 (13) (2009)
Louis Esperet, Mickaël Montassier, Xuding Zhu
Adapted list coloring of planar graphs. J. Graph Theory 62 (2) (2009)
Mickaël Montassier, André Raspaud, Xuding Zhu
An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30 (2) (2009)
Louis Esperet, Mickaël Montassier, André Raspaud
Linear choosability of graphs. Discret. Math. 308 (17) (2008)
Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
A relaxation of Havel's 3-color problem. Inf. Process. Lett. 107 (3-4) (2008)
Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. 10 (1) (2008)
Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
Strong oriented chromatic number of planar graphs without cycles of specific lengths. Electron. Notes Discret. Math. 30 (2008)
Mickaël Montassier, André Raspaud, Weifan Wang
Acyclic 5-choosability of planar graphs without small cycles. J. Graph Theory 54 (3) (2007)
Mickaël Montassier
-colorable planar graph. Discret. Math. 307 (13) (2007)
Fabrice Bazzaro, Mickaël Montassier, André Raspaud
(d, 1)-total labelling of planar graphs with large girth and high maximum degree. Discret. Math. 307 (16) (2007)
Mickaël Montassier, André Raspaud
, 1)-total labeling of graphs with a given maximum average degree. J. Graph Theory 51 (2) (2006)
Mickaël Montassier, André Raspaud, Weifan Wang
Bordeaux 3-color conjecture and 3-choosability. Discret. Math. 306 (6) (2006)
Mickaël Montassier, André Raspaud
A note on 2-facial coloring of plane graphs. Inf. Process. Lett. 98 (6) (2006)
Mickaël Montassier
A note on the not 3-choosability of some families of planar graphs. Inf. Process. Lett. 99 (2) (2006)
Mickaël Montassier, Pascal Ochem, André Raspaud
On the acyclic choosability of graphs. J. Graph Theory 51 (4) (2006)
Daniel Gonçalves, Mickaël Montassier
Acyclic Choosability of Graphs with Small Maximum Degree. WG (2005)