Mickaël Montassier

74 papers B 2Journal 72

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