Mickael Montassier

Documents

Présentation

Short bio: I received the PhD degree from the University of Bordeaux in 2005 and the "HDR" degree in 2010. Currently, I am affiliated to the laboratory LIRMM (Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier) as full professor in the group « Algorithms for Graphs and Combinatorics ». My research interests include graph colorings (list-colorings, oriented colorings, group-coloring, labeling), structures (vertex partition,...) and design of fault tolerant networks...

Publications

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

Christopher Duffy , Fabien Jacques , Mickaël Montassier , Alexandre Pinlou

Discrete Mathematics, 2023, 346 (10), pp.113579. ⟨10.1016/j.disc.2023.113579⟩

Article dans une revue lirmm-04227159v1

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

Xuan Hoang La , Mickaël Montassier

Journal of Combinatorial Optimization, 2022, 44 (2), pp.1356-1375. ⟨10.1007/s10878-022-00883-w⟩

Article dans une revue lirmm-04041786v1

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

Xuan Hoang La , Mickaël Montassier , Alexandre Pinlou , Petru Valicov

European Journal of Combinatorics, 2021, 91, pp.#103219. ⟨10.1016/j.ejc.2020.103219⟩

Article dans une revue lirmm-03475125v1

Acyclic coloring of graphs and entropy compression method

Daniel Gonçalves , Mickaël Montassier , Alexandre Pinlou

Discrete Mathematics, 2020, 343 (4), pp.#111772. ⟨10.1016/j.disc.2019.111772⟩

Article dans une revue lirmm-02938618v1

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

Discrete Mathematics, 2019, 342 (4), pp.943-950. ⟨10.1016/j.disc.2018.11.023⟩

Article dans une revue lirmm-02010775v1

Large induced forests in planar graphs with girth 4

François Dross , Mickaël Montassier , Alexandre Pinlou

Discrete Applied Mathematics, 2019, 254, pp.96-106. ⟨10.1016/j.dam.2018.06.029⟩

Article dans une revue lirmm-02021020v1

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

François Dross , Mickaël Montassier , Alexandre Pinlou

The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.45. ⟨10.37236/6815⟩

Article dans une revue lirmm-01730269v1

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

François Dross , Mickaël Montassier , Alexandre Pinlou

European Journal of Combinatorics, 2017, 66, pp.81-94. ⟨10.1016/j.ejc.2017.06.014⟩

Article dans une revue lirmm-01430784v1

3-path in graphs with bounded average degree

Stanislav Jendrol , Mária Maceková , Mickaël Montassier , Roman Soták

Discussiones Mathematicae Graph Theory, 2016, 36 (2), pp.339-353. ⟨10.7151/dmgt.1859⟩

Article dans une revue lirmm-01346642v1

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

Discrete Applied Mathematics, 2016, 214, pp.99-107. ⟨10.1016/j.dam.2016.06.011⟩

Article dans une revue lirmm-01375448v1

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

Discrete Mathematics, 2016, 339 (2), pp.780 - 789. ⟨10.1016/j.disc.2015.10.016⟩

Article dans une revue lirmm-01263824v1

Near-colorings: non-colorable graphs and NP-completeness

Mickaël Montassier , Pascal Ochem

The Electronic Journal of Combinatorics, 2015, 22 (1), pp.#P1.57. ⟨10.37236/3509⟩

Article dans une revue lirmm-01263770v1

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

Olivier Delmas , Frédéric Havet , Mickaël Montassier , Stéphane Pérennes

Theoretical Computer Science, 2015, 562, pp.75-89. ⟨10.1016/j.tcs.2014.09.034⟩

Article dans une revue hal-01111370v1

Independent Domination in Cubic Graphs

Paul Dorbec , Michael A. Henning , Mickaël Montassier , Justin Southey

Journal of Graph Theory, 2015, 80 (4), pp.329-349. ⟨10.1002/jgt.21855⟩

Article dans une revue istex lirmm-01263782v1

Limits of near-coloring of sparse graphs

Paul Dorbec , Tomas Kaiser , Mickael Montassier , André Raspaud

Journal of Graph Theory, 2014, 75 (2), pp.191-202. ⟨10.1002/jgt.21731⟩

Article dans une revue istex hal-00911263v1

Strong chromatic index of planar graphs with large girth

Gerard Jennhwa Chang , Mickaël Montassier , Arnaud Pêcher , André Raspaud

Discussiones Mathematicae Graph Theory, 2014, 34 (4), pp.723-733. ⟨10.7151/dmgt.1763⟩

Article dans une revue hal-00920932v1

Vertex Partitions of Graphs into Cographs and Stars

Paul Dorbec , Mickael Montassier , Pascal Ochem

Journal of Graph Theory, 2013, 75, pp.75-90. ⟨10.1002/jgt.21724⟩

Article dans une revue istex hal-00911272v1

Generalized power domination in regular graphs

Paul Dorbec , Michael Antony Henning , Christian Löwenstein , Mickael Montassier , André Raspaud

SIAM Journal on Discrete Mathematics, 2013, 27 (3), pp.1559-1574. ⟨10.1137/120891356⟩

Article dans une revue hal-00903699v1

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $\Delta$

Hervé Hocquard , Mickaël Montassier

Journal of Combinatorial Optimization, 2013, 26 (1), pp.152-160. ⟨10.1007/s10878-011-9444-9⟩

Article dans une revue istex lirmm-00782842v1

A Complexity Dichotomy for the Coloring of Sparse Graphs

Louis Esperet , Mickaël Montassier , Pascal Ochem , Alexandre Pinlou

Journal of Graph Theory, 2013, 73 (1), pp.85-102. ⟨10.1002/jgt.21659⟩

Article dans une revue istex lirmm-00736468v1

On strong edge-colouring of subcubic graphs

Hervé Hocquard , Mickael Montassier , André Raspaud , Petru Valicov

Discrete Applied Mathematics, 2013, 161 (16-17), pp.2467-2479. ⟨10.1016/j.dam.2013.05.021⟩

Article dans une revue hal-00686021v2

Generalized power domination of graphs

Gerard Jennhwa Chang , Paul Dorbec , Mickael Montassier , André Raspaud

Discrete Applied Mathematics, 2012, 160 (12), pp.1691-1698. ⟨10.1016/j.dam.2012.03.007⟩

Article dans une revue hal-00591512v1

Locally identifying coloring of graphs

Louis Esperet , Sylvain Gravier , Mickael Montassier , Pascal Ochem , Aline Parreau

The Electronic Journal of Combinatorics, 2012, 19 (2), pp.40. ⟨10.37236/2417⟩

Article dans une revue hal-00529640v2

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

Min Chen , Mickaël Montassier , André Raspaud

Discrete Mathematics, 2012, 312 (2), pp.362-373. ⟨10.1016/j.disc.2011.09.028⟩

Article dans une revue lirmm-00782828v1

L(p,q)-labeling of sparse graphs

Clément Charpentier , Mickaël Montassier , André Raspaud

Journal of Combinatorial Optimization, 2012, 25 (4), pp.646-660. ⟨10.1007/s10878-012-9507-6⟩

Article dans une revue istex lirmm-00738574v1

(k,1)-coloring of sparse graphs

Oleg V. Borodin , Anna O. Ivanova , Mickaël Montassier , André Raspaud

Discrete Mathematics, 2012, 312 (6), pp.1128-1135. ⟨10.1016/j.disc.2011.11.031⟩

Article dans une revue lirmm-00782819v1

Decomposing a graph into forests

Mickael Montassier , Patrice Ossona de Mendez , André Raspaud , Xuding Zhu

Journal of Combinatorial Theory, Series B, 2012, 102 (1), pp.38-52. ⟨10.1016/j.jctb.2011.04.001⟩

Article dans une revue hal-00656800v1

On backbone coloring of graphs

Yuehua Bu , Mickaël Montassier , André Raspaud , Weifan Wang

Journal of Combinatorial Optimization, 2012, 23, pp.79-93. ⟨10.1007/s10878-010-9342-6⟩

Article dans une revue istex lirmm-00782811v1

On two variations of identifying codes

Olivier Delmas , Sylvain Gravier , Mickael Montassier , Aline Parreau

Discrete Mathematics, 2011, 311 (17), pp.1948-1956. ⟨10.1016/j.disc.2011.05.018⟩

Article dans une revue hal-00475625v2

(k,j)-coloring of sparse graphs

O.V. Borodin , A.O. Ivanova , A. Raspaud , Mickaël Montassier , André Raspaud

Discrete Applied Mathematics, 2011, 159 (17), ⟨10.1016/j.dam.2011.06.021⟩

Article dans une revue lirmm-01263802v1

Covering a Graph by Forests and a Matching

Tomáš Kaiser , Mickaël Montassier , André Raspaud

SIAM Journal on Discrete Mathematics, 2011, 25 (4), pp.1804-1811. ⟨10.1137/100818340⟩

Article dans une revue lirmm-01263789v1

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

Hervé Hocquard , Mickaël Montassier

Electronic Notes in Discrete Mathematics, 2011, 38, pp.457-462. ⟨10.1016/j.endm.2011.09.074⟩

Article dans une revue istex lirmm-01264287v1

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

Mickaël Montassier , André Raspaud , Xuding Zhu

Information Processing Letters, 2010, 110 (20), pp.913-916. ⟨10.1016/j.ipl.2010.07.009⟩

Article dans une revue istex lirmm-01263807v1

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

Hervé Hocquard , Mickaël Montassier , André Raspaud

Discrete Applied Mathematics, 2010, 158 (10), pp.1104-1110. ⟨10.1016/j.dam.2010.02.005⟩

Article dans une revue lirmm-01263813v1

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

O.V. Borodin , A.O. Ivanova , Mickael Montassier , Pascal Ochem , André Raspaud

Journal of Graph Theory, 2010, 65 (2), pp.83-93. ⟨10.1002/jgt.20467⟩

Article dans une revue hal-00377372v1

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

O.V. Borodin , Mickael Montassier , André Raspaud

Discrete Mathematics, 2010, 310 (1), pp.167-173

Article dans une revue hal-00401710v1

Decomposition of sparse graphs, with application to game coloring number

Mickaël Montassier , Arnaud Pêcher , André Raspaud , Douglas B. West , Xuding Zhu

Contributions to Discrete Mathematics, 2010, 310 (10-11), ⟨10.1016/j.disc.2010.01.008⟩

Article dans une revue lirmm-01263814v1

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

Hervé Hocquard , Mickael Montassier

Information Processing Letters, 2009

Article dans une revue hal-00402807v1

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

O.V. Borodin , A.N. Glebov , Mickael Montassier , André Raspaud

Journal of Combinatorial Theory, Series B, 2009, 99 (4), pp.668-673

Article dans une revue hal-00349110v1

Adapted list colouring of planar graphs

Louis Esperet , Mickael Montassier , Xuding Zhu

Journal of Graph Theory, 2009, 62 (2), pp.127-138

Article dans une revue hal-00349116v1

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

Yuehua Bu , Huajing Lu , Mickael Montassier , André Raspaud , Weifan Wang et al.

Discrete Mathematics, 2009, 309 (13), pp.4596-4607. ⟨10.1016/j.disc.2009.02.030⟩

Article dans une revue hal-00369723v1

Star coloring of sparse graphs.

Yuehua Bu , Daniel W. Cranston , Mickael Montassier , André Raspaud , Weifan Wang

Journal of Graph Theory, 2009, 62 (3), pp.201-219

Article dans une revue hal-00349115v1

An upper bound on the adaptable choosability of graphs.

Mickael Montassier , André Raspaud , Xuding Zhu

European Journal of Combinatorics, 2009, 30 (2), pp.351-355. ⟨10.1016/j.ejc.2008.06.003⟩

Article dans une revue hal-00322868v1

A relaxation of Havel's 3-color problem

Mickael Montassier , André Raspaud , Weifan Wang , Yingqian Wang

Information Processing Letters, 2008, 107 (3-4), pp.107-109

Article dans une revue hal-00300736v1

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles

Mickaël Montassier , Pascal Ochem , Alexandre Pinlou

Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.1-24. ⟨10.46298/dmtcs.418⟩

Article dans une revue lirmm-00184811v1

Linear choosability of graphs

Louis Esperet , Mickael Montassier , André Raspaud

Discrete Mathematics, 2008, 308 (17), pp.3938-3950

Article dans une revue hal-00306479v1

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

Fabrice Bazzaro , Mickael Montassier , André Raspaud

Discrete Mathematics, 2007, 307, pp.2141-2151

Article dans une revue hal-00293465v1

Acyclic 5-choosability of planar graphs without small cycles.

Mickael Montassier , André Raspaud , Weifan Wang

Journal of Graph Theory, 2007, 54, pp.245--260

Article dans une revue hal-00307135v1

A small non-Z4-colorable planar graph

Mickael Montassier

Discrete Mathematics, 2007, 307 (13), pp.1684--1686

Article dans une revue hal-00285580v1

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

Mickael Montassier

Information Processing Letters, 2006, 99, pp.68--71

Article dans une revue hal-00307136v1

Acyclic 4-choosability of planar graphs without cycles of specific length

Mickael Montassier , André Raspaud , Weifan Wang

Algorithms and Combinatorics, 2006, 26, pp.473--491

Article dans une revue hal-00307141v1

On the acyclic choosability of graphs

Mickael Montassier , Pascal Ochem , André Raspaud

Journal of Graph Theory, 2006, 51, pp.281--300

Article dans une revue hal-00307137v1

Bordeaux 3-color conjecture and 3-choosability

Mickael Montassier , André Raspaud , Weifan Wang

Discrete Mathematics, 2006, 306 (6), pp.573-579

Article dans une revue hal-00306480v1

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

Mickael Montassier , André Raspaud

Journal of Graph Theory, 2006, 51, pp.93--109

Article dans une revue hal-00307139v1

Linear choosability of graphs

Louis Esperet , Mickael Montassier , André Raspaud

Discrete Mathematics and Theoretical Computer Science, 2005, DMTCS Proceedings, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.99-104. ⟨10.46298/dmtcs.3434⟩

Article dans une revue hal-01184391v1

A note on 2-facial coloring of plane graphs

Mickael Montassier , André Raspaud

Information Processing Letters, 2005, 98, pp.235--241

Article dans une revue hal-00307134v1

The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree

Fabien Jacques , Mickaël Montassier , Alexandre Pinlou

BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France

Communication dans un congrès lirmm-02938635v1

r-hued coloring of planar graphs with girth at least 8

Xuan Hoang La , Mickaël Montassier , Alexandre Pinlou , Petru Valicov

BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France

Communication dans un congrès lirmm-02938645v1

Partitioning sparse graphs into an independent set and a forest of bounded degree

François Dross , Mickaël Montassier , Alexandre Pinlou

BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France

Communication dans un congrès lirmm-01430813v1

Vertex-partitions of graphs

Mickaël Montassier

ICGCA: International Conference on Graph theory, Combinatorics and their Applications, Oct 2016, Jinhua, China

Communication dans un congrès lirmm-01430816v1

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

François Dross , Mickaël Montassier , Alexandre Pinlou

EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275, ⟨10.1016/j.endm.2015.06.037⟩

Communication dans un congrès lirmm-01233461v1

Entropy compression method and graph coloring problems

Mickaël Montassier

C&C: Cycles and Colourings, 2014, Novy Smokovec, Slovakia

Communication dans un congrès lirmm-01264376v1

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

Steven Chaplick , Paul Dorbec , Jan Kratochvil , Mickaël Montassier , Juraj Stacho

WG 2014 - 40th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-fuzelier, France. pp.139-151, ⟨10.1007/978-3-319-12340-0_12⟩

Communication dans un congrès lirmm-01264271v1