×

zbMATH — the first resource for mathematics

Montassier, Mickaël

Compute Distance To:
Author ID: montassier.mickael Recent zbMATH articles by "Montassier, Mickaël"
Published as: Montassier, M.; Montassier, Mickael; Montassier, Mickaël
External Links: MGP
Documents Indexed: 62 Publications since 2005

Publications by Year

Citations contained in zbMATH

52 Publications have been cited 492 times in 323 Documents Cited by Year
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\). Zbl 1209.05177
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Ochem, P.; Raspaud, A.
24
2010
\((d,1)\)-total labeling of graphs with a given maximum average degree. Zbl 1084.05061
Montassier, Mickaël; Raspaud, André
22
2006
Acyclic 5-choosability of planar graphs without small cycles. Zbl 1114.05037
Montassier, Mickaël; Raspaud, André; Wang, Weifan
21
2007
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\). Zbl 1276.90079
Hocquard, Hervé; Montassier, Mickaël
20
2013
Acyclic 4-choosability of planar graphs withot cycles of specific lengths. Zbl 1120.05034
Montassier, Mickaël; Raspaud, André; Wang, Weifan
20
2006
On the acyclic choosability of graphs. Zbl 1107.05036
Montassier, Mickaël; Ochem, Pascal; Raspaud, André
20
2006
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. Zbl 1184.05024
Borodin, O. V.; Glebov, A. N.; Montassier, M.; Raspaud, A.
19
2009
Near-colorings: non-colorable graphs and NP-completeness. Zbl 1308.05052
Montassier, M.; Ochem, P.
18
2015
Decomposing a graph into forests. Zbl 1237.05167
Montassier, Mickael; de Mendez, Patrice Ossona; Raspaud, André; Zhu, Xuding
18
2012
On strong edge-colouring of subcubic graphs. Zbl 1285.05060
Hocquard, Hervé; Montassier, Mickaël; Raspaud, André; Valicov, Petru
16
2013
Star coloring of sparse graphs. Zbl 1179.05042
Bu, Yuehua; Cranston, Daniel W.; Montassier, Mickaël; Raspaud, André; Wang, Weifan
16
2009
Linear choosability of graphs. Zbl 1203.05054
Esperet, Louis; Montassier, Mickaël; Raspaud, André
16
2008
\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree. Zbl 1120.05076
Bazzaro, Fabrice; Montassier, Mickaël; Raspaud, André
16
2007
Generalized power domination of graphs. Zbl 1244.05165
Chang, Gerard Jennhwa; Dorbec, Paul; Montassier, Mickael; Raspaud, André
15
2012
Acyclic 4-choosability of planar graphs with girth at least 5. Zbl 1118.05036
Montassier, Mickaël
14
2007
Strong chromatic index of planar graphs with large girth. Zbl 1303.05063
Jennhwa Chang, Gerard; Montassier, Mickael; Pêcher, Arnaud; Raspaud, André
11
2014
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Zbl 1274.05159
Hocquard, Hervé; Montassier, Mickaël
11
2011
Adapted list coloring of planar graphs. Zbl 1221.05136
Esperet, Louis; Montassier, Mickaël; Zhu, Xuding
11
2009
A note on the not 3-choosability of some families of planar graphs. Zbl 1184.05048
Montassier, Mickaël
11
2006
Contact representations of planar graphs: extending a partial representation is hard. Zbl 1417.05133
Chaplick, Steven; Dorbec, Paul; Kratochvíl, Jan; Montassier, Mickael; Stacho, Juraj
10
2014
A complexity dichotomy for the coloring of sparse graphs. Zbl 1264.05049
Esperet, Louis; Montassier, Mickaël; Ochem, Pascal; Pinlou, Alexandre
10
2013
Bordeaux 3-color conjecture and 3-choosability. Zbl 1090.05029
Montassier, Mickaël; Raspaud, André; Wang, Weifan
10
2006
Generalized power domination in regular graphs. Zbl 1290.05117
Dorbec, Paul; Henning, Michael A.; Löwenstein, Christian; Montassier, Mickael; Raspaud, André
9
2013
\((k,1)\)-coloring of sparse graphs. Zbl 1238.05084
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
9
2012
Decomposition of sparse graphs, with application to game coloring number. Zbl 1219.05145
Montassier, Mickael; Pêcher, Arnaud; Raspaud, André; West, Douglas B.; Zhu, Xuding
9
2010
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Zbl 1221.05071
Borodin, Oleg V.; Montassier, Mickael; Raspaud, André
9
2010
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Zbl 1197.05050
Hocquard, Hervé; Montassier, Mickaël
9
2009
A note on 2-facial coloring of plane graphs. Zbl 1178.05042
Montassier, Mickaël; Raspaud, André
8
2006
Independent domination in cubic graphs. Zbl 1330.05117
Dorbec, Paul; Henning, Michael A.; Montassier, Mickael; Southey, Justin
7
2015
Limits of near-coloring of sparse graphs. Zbl 1280.05040
Dorbec, Paul; Kaiser, Tomáš; Montassier, Mickael; Raspaud, André
7
2014
\((k,j)\)-coloring of sparse graphs. Zbl 1239.05059
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
7
2011
A lower bound on the order of the largest induced forest in planar graphs with high girth. Zbl 1346.05039
Dross, François; Montassier, Mickael; Pinlou, Alexandre
6
2016
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Zbl 1327.05081
Jendrol’, S.; Maceková, M.; Montassier, M.; Soták, R.
6
2016
\(L(p,q)\)-labeling of sparse graphs. Zbl 1295.90097
Charpentier, Clément; Montassier, Mickaël; Raspaud, André
6
2013
Locally identifying coloring of graphs. Zbl 1252.05061
Esperet, Louis; Gravier, Sylvain; Montassier, Mickaël; Ochem, Pascal; Parreau, Aline
6
2012
On backbone coloring of graphs. Zbl 1245.90138
Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
5
2012
An upper bound on adaptable choosability of graphs. Zbl 1209.05094
Montassier, Mickaël; Raspaud, André; Zhu, Xuding
5
2009
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Zbl 1369.05169
Dross, François; Montassier, Mickael; Pinlou, Alexandre
4
2017
3-paths in graphs with bounded average degree. Zbl 1338.05054
Jendrol’, Stanislav; Maceková, Mária; Montassier, Mickaël; Soták, Roman
4
2016
A relaxation of Havel’s 3-color problem. Zbl 1185.05062
Montassier, Mickaël; Raspaud, André; Wang, Weifan; Wang, Yingqian
4
2008
Acyclic choosability of graphs with small maximum degree. Zbl 1171.05332
Gonçalves, Daniel; Montassier, Mickaël
4
2005
Covering a graph by forests and a matching. Zbl 1237.05164
Kaiser, Tomáš; Montassier, Mickaël; Raspaud, André
3
2011
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Zbl 1209.05092
Lu, Huajing; Wang, Yingqian; Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
3
2009
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Zbl 1346.05228
Dross, Franois; Montassier, Mickael; Pinlou, Alexandre
2
2015
Vertex partitions of graphs into cographs and stars. Zbl 1280.05104
Dorbec, Paul; Montassier, Mickael; Ochem, Pascal
2
2014
Strong oriented chromatic number of planar graphs without short cycles. Zbl 1153.05027
Montassier, Mickaël; Ochem, Pascal; Pinlou, Alexandre
2
2008
A small non-\(\mathbb Z_4\)-colorable planar graph. Zbl 1119.05046
Montassier, Mickaël
2
2007
Partitioning sparse graphs into an independent set and a forest of bounded degree. Zbl 1391.05091
Dross, François; Montassier, Mickael; Pinlou, Alexandre
1
2018
Design of fault-tolerant on-board networks with variable switch sizes. Zbl 1306.90027
Delmas, O.; Havet, F.; Montassier, M.; Pérennes, S.
1
2015
Strong chromatic index of planar graphs with large girth. Zbl 1303.05066
Montassier, Mickaël; Pêcher, Arnaud; Raspaud, André
1
2013
A note on the acyclic 3-choosability of some planar graphs. Zbl 1220.05040
Hocquard, Hervé; Montassier, Mickaël; Raspaud, André
1
2010
Linear choosability of graphs. Zbl 1192.05048
Esperet, Louis; Montassier, Mickaël; Raspaud, André
1
2005
Partitioning sparse graphs into an independent set and a forest of bounded degree. Zbl 1391.05091
Dross, François; Montassier, Mickael; Pinlou, Alexandre
1
2018
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Zbl 1369.05169
Dross, François; Montassier, Mickael; Pinlou, Alexandre
4
2017
A lower bound on the order of the largest induced forest in planar graphs with high girth. Zbl 1346.05039
Dross, François; Montassier, Mickael; Pinlou, Alexandre
6
2016
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Zbl 1327.05081
Jendrol’, S.; Maceková, M.; Montassier, M.; Soták, R.
6
2016
3-paths in graphs with bounded average degree. Zbl 1338.05054
Jendrol’, Stanislav; Maceková, Mária; Montassier, Mickaël; Soták, Roman
4
2016
Near-colorings: non-colorable graphs and NP-completeness. Zbl 1308.05052
Montassier, M.; Ochem, P.
18
2015
Independent domination in cubic graphs. Zbl 1330.05117
Dorbec, Paul; Henning, Michael A.; Montassier, Mickael; Southey, Justin
7
2015
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Zbl 1346.05228
Dross, Franois; Montassier, Mickael; Pinlou, Alexandre
2
2015
Design of fault-tolerant on-board networks with variable switch sizes. Zbl 1306.90027
Delmas, O.; Havet, F.; Montassier, M.; Pérennes, S.
1
2015
Strong chromatic index of planar graphs with large girth. Zbl 1303.05063
Jennhwa Chang, Gerard; Montassier, Mickael; Pêcher, Arnaud; Raspaud, André
11
2014
Contact representations of planar graphs: extending a partial representation is hard. Zbl 1417.05133
Chaplick, Steven; Dorbec, Paul; Kratochvíl, Jan; Montassier, Mickael; Stacho, Juraj
10
2014
Limits of near-coloring of sparse graphs. Zbl 1280.05040
Dorbec, Paul; Kaiser, Tomáš; Montassier, Mickael; Raspaud, André
7
2014
Vertex partitions of graphs into cographs and stars. Zbl 1280.05104
Dorbec, Paul; Montassier, Mickael; Ochem, Pascal
2
2014
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\). Zbl 1276.90079
Hocquard, Hervé; Montassier, Mickaël
20
2013
On strong edge-colouring of subcubic graphs. Zbl 1285.05060
Hocquard, Hervé; Montassier, Mickaël; Raspaud, André; Valicov, Petru
16
2013
A complexity dichotomy for the coloring of sparse graphs. Zbl 1264.05049
Esperet, Louis; Montassier, Mickaël; Ochem, Pascal; Pinlou, Alexandre
10
2013
Generalized power domination in regular graphs. Zbl 1290.05117
Dorbec, Paul; Henning, Michael A.; Löwenstein, Christian; Montassier, Mickael; Raspaud, André
9
2013
\(L(p,q)\)-labeling of sparse graphs. Zbl 1295.90097
Charpentier, Clément; Montassier, Mickaël; Raspaud, André
6
2013
Strong chromatic index of planar graphs with large girth. Zbl 1303.05066
Montassier, Mickaël; Pêcher, Arnaud; Raspaud, André
1
2013
Decomposing a graph into forests. Zbl 1237.05167
Montassier, Mickael; de Mendez, Patrice Ossona; Raspaud, André; Zhu, Xuding
18
2012
Generalized power domination of graphs. Zbl 1244.05165
Chang, Gerard Jennhwa; Dorbec, Paul; Montassier, Mickael; Raspaud, André
15
2012
\((k,1)\)-coloring of sparse graphs. Zbl 1238.05084
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
9
2012
Locally identifying coloring of graphs. Zbl 1252.05061
Esperet, Louis; Gravier, Sylvain; Montassier, Mickaël; Ochem, Pascal; Parreau, Aline
6
2012
On backbone coloring of graphs. Zbl 1245.90138
Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
5
2012
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Zbl 1274.05159
Hocquard, Hervé; Montassier, Mickaël
11
2011
\((k,j)\)-coloring of sparse graphs. Zbl 1239.05059
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
7
2011
Covering a graph by forests and a matching. Zbl 1237.05164
Kaiser, Tomáš; Montassier, Mickaël; Raspaud, André
3
2011
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\). Zbl 1209.05177
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Ochem, P.; Raspaud, A.
24
2010
Decomposition of sparse graphs, with application to game coloring number. Zbl 1219.05145
Montassier, Mickael; Pêcher, Arnaud; Raspaud, André; West, Douglas B.; Zhu, Xuding
9
2010
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Zbl 1221.05071
Borodin, Oleg V.; Montassier, Mickael; Raspaud, André
9
2010
A note on the acyclic 3-choosability of some planar graphs. Zbl 1220.05040
Hocquard, Hervé; Montassier, Mickaël; Raspaud, André
1
2010
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. Zbl 1184.05024
Borodin, O. V.; Glebov, A. N.; Montassier, M.; Raspaud, A.
19
2009
Star coloring of sparse graphs. Zbl 1179.05042
Bu, Yuehua; Cranston, Daniel W.; Montassier, Mickaël; Raspaud, André; Wang, Weifan
16
2009
Adapted list coloring of planar graphs. Zbl 1221.05136
Esperet, Louis; Montassier, Mickaël; Zhu, Xuding
11
2009
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Zbl 1197.05050
Hocquard, Hervé; Montassier, Mickaël
9
2009
An upper bound on adaptable choosability of graphs. Zbl 1209.05094
Montassier, Mickaël; Raspaud, André; Zhu, Xuding
5
2009
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Zbl 1209.05092
Lu, Huajing; Wang, Yingqian; Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
3
2009
Linear choosability of graphs. Zbl 1203.05054
Esperet, Louis; Montassier, Mickaël; Raspaud, André
16
2008
A relaxation of Havel’s 3-color problem. Zbl 1185.05062
Montassier, Mickaël; Raspaud, André; Wang, Weifan; Wang, Yingqian
4
2008
Strong oriented chromatic number of planar graphs without short cycles. Zbl 1153.05027
Montassier, Mickaël; Ochem, Pascal; Pinlou, Alexandre
2
2008
Acyclic 5-choosability of planar graphs without small cycles. Zbl 1114.05037
Montassier, Mickaël; Raspaud, André; Wang, Weifan
21
2007
\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree. Zbl 1120.05076
Bazzaro, Fabrice; Montassier, Mickaël; Raspaud, André
16
2007
Acyclic 4-choosability of planar graphs with girth at least 5. Zbl 1118.05036
Montassier, Mickaël
14
2007
A small non-\(\mathbb Z_4\)-colorable planar graph. Zbl 1119.05046
Montassier, Mickaël
2
2007
\((d,1)\)-total labeling of graphs with a given maximum average degree. Zbl 1084.05061
Montassier, Mickaël; Raspaud, André
22
2006
Acyclic 4-choosability of planar graphs withot cycles of specific lengths. Zbl 1120.05034
Montassier, Mickaël; Raspaud, André; Wang, Weifan
20
2006
On the acyclic choosability of graphs. Zbl 1107.05036
Montassier, Mickaël; Ochem, Pascal; Raspaud, André
20
2006
A note on the not 3-choosability of some families of planar graphs. Zbl 1184.05048
Montassier, Mickaël
11
2006
Bordeaux 3-color conjecture and 3-choosability. Zbl 1090.05029
Montassier, Mickaël; Raspaud, André; Wang, Weifan
10
2006
A note on 2-facial coloring of plane graphs. Zbl 1178.05042
Montassier, Mickaël; Raspaud, André
8
2006
Acyclic choosability of graphs with small maximum degree. Zbl 1171.05332
Gonçalves, Daniel; Montassier, Mickaël
4
2005
Linear choosability of graphs. Zbl 1192.05048
Esperet, Louis; Montassier, Mickaël; Raspaud, André
1
2005
all top 5

Cited by 437 Authors

30 Wang, Wei-Fan
29 Raspaud, André
23 Borodin, Oleg Veniaminovich
20 Montassier, Mickaël
18 Chen, Min
18 Zhu, Xuding
15 Ivanova, Anna Olegovna
13 Kostochka, Aleksandr Vasil’evich
13 Wang, Yingqian
12 Yu, Gexin
9 Bu, Yuehua
8 Chen, Dong
8 Choi, Ilkyoo
7 Dross, François
7 Henning, Michael Anthony
7 Huang, Danjun
7 Ochem, Pascal
7 Wang, Yiqiao
6 Glebov, Alekseĭ Nikolaevich
6 Hocquard, Hervé
6 Li, Xiangwen
6 Liu, Guizhen
6 Pinlou, Alexandre
6 Škrekovski, Riste
5 Chang, Gerard Jennhwa
5 Lužar, Borut
5 Wu, Jian-Liang
5 Yancey, Matthew P.
5 Yang, Daqing
5 Zhang, Xin
4 Charpentier, Clément
4 Cranston, Daniel W.
4 Dong, Wei
4 Dvořák, Zdeněk
4 Hou, Jianfeng
4 Klavík, Pavel
4 Lidický, Bernard
4 Roussel, Nicolas
4 Soták, Roman
4 West, Douglas Brent
4 Xu, Baogang
3 Chaplick, Steven
3 Chen, Ming
3 Chia, Ma-Lian
3 Czap, Július
3 Effantin, Brice
3 Esperet, Louis
3 Ferrero, Daniela
3 Hasunuma, Toru
3 Havet, Frédéric
3 Hogben, Leslie
3 Ishii, Toshimasa
3 Jendrol’, Stanislav
3 Jiang, Yiting
3 Kang, Yingli
3 Kheddouci, Hamamache
3 Kim, Jaehoon
3 Klavžar, Sandi
3 Kuo, David Li-Wei
3 Lih, Kowei
3 Liotta, Giuseppe
3 Liu, Chun-Hung
3 Liu, Daphne Der-Fen
3 Liu, Runrun
3 Lu, Changhong
3 Lu, Huajing
3 Lv, Jianbo
3 Miao, Zhengke
3 Ono, Hirotaka
3 Otachi, Yota
3 Przybyło, Jakub
3 Rautenbach, Dieter
3 Sampaio, Rudini Menezes
3 Shao, Zehui
3 Shu, Qiaojun
3 Sopena, Éric
3 Uno, Yushi
3 Varghese, Seethu
3 Vijayakumar, Ambat
3 Wang, Guanghui
3 Zhu, Enqiang
2 Abrishami, Gholamreza
2 Bartnicki, Tomasz
2 Bensmail, Julien
2 Bonamy, Marthe
2 Bosek, Bartłomiej
2 Brandt, Axel
2 Brimkov, Boris
2 Cai, Jiansheng
2 Chang, Feihuang
2 Czerwiński, Sebastian
2 Dekar, Lyes
2 Deng, Kecai
2 Ding, Laihao
2 Dorbec, Paul
2 Fan, Genghua
2 Ferrara, Michael J.
2 Finbow, Stephen
2 Flagg, Mary
2 Gao, Yuping
...and 337 more Authors
all top 5

Cited in 42 Serials

70 Discrete Mathematics
38 Discrete Applied Mathematics
23 Journal of Graph Theory
23 Journal of Combinatorial Optimization
18 European Journal of Combinatorics
17 Information Processing Letters
14 Graphs and Combinatorics
13 Journal of Combinatorial Theory. Series B
11 Discrete Mathematics, Algorithms and Applications
9 Discussiones Mathematicae. Graph Theory
7 Applied Mathematics and Computation
6 Theoretical Computer Science
6 SIAM Journal on Discrete Mathematics
5 The Electronic Journal of Combinatorics
5 Sibirskie Èlektronnye Matematicheskie Izvestiya
4 Algorithmica
4 Acta Mathematica Sinica. English Series
4 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
3 Acta Mathematicae Applicatae Sinica. English Series
2 Siberian Mathematical Journal
2 Computational Geometry
2 Journal of Graph Algorithms and Applications
2 Journal of Discrete Algorithms
2 Science China. Mathematics
1 Annali di Matematica Pura ed Applicata. Serie Quarta
1 Networks
1 Proceedings of the Japan Academy. Series A
1 Bulletin of the Korean Mathematical Society
1 Combinatorica
1 Acta Applicandae Mathematicae
1 Science in China. Series A
1 International Journal of Computer Mathematics
1 The Australasian Journal of Combinatorics
1 Combinatorics, Probability and Computing
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Journal of Systems Science and Complexity
1 Central European Journal of Mathematics
1 Discrete Optimization
1 Proyecciones
1 Contributions to Discrete Mathematics
1 Frontiers of Mathematics in China
1 Transactions of the American Mathematical Society. Series B

Citations by Year