default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMickaël Montassier
- > Home > Persons > Mickaël Montassier
Publications
- 2014
[j43]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): 723-733 (2014)- [j41]Paul Dorbec, Tomás Kaiser, Mickaël Montassier, André Raspaud:
Limits of Near-Coloring of Sparse Graphs. J. Graph Theory 75(2): 191-202 (2014) - 2013
- [j40]Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov:
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161(16-17): 2467-2479 (2013) - [j39]Clément Charpentier, Mickaël Montassier, André Raspaud:
L(p, q)-labeling of sparse graphs. J. Comb. Optim. 25(4): 646-660 (2013) - [j36]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): 1559-1574 (2013) - 2012
- [j34]Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud:
Generalized power domination of graphs. Discret. Appl. Math. 160(12): 1691-1698 (2012) - [j33]Min Chen, Mickaël Montassier, André Raspaud:
Some structural properties of planar graphs and their applications to 3-choosability. Discret. Math. 312(2): 362-373 (2012) - [j32]Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud:
(k, 1)-coloring of sparse graphs. Discret. Math. 312(6): 1128-1135 (2012) - [j31]Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud:
On backbone coloring of graphs. J. Comb. Optim. 23(1): 79-93 (2012) - [j30]Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu:
Decomposing a graph into forests. J. Comb. Theory B 102(1): 38-52 (2012) - 2011
- [j29]Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud:
(k, j)-coloring of sparse graphs. Discret. Appl. Math. 159(17): 1947-1953 (2011) - [j27]Clément Charpentier, Mickaël Montassier, André Raspaud:
Minmax degree of graphs (Extended abstract). Electron. Notes Discret. Math. 38: 251-257 (2011) - [j25]Tomás Kaiser, Mickaël Montassier, André Raspaud:
Covering a Graph by Forests and a Matching. SIAM J. Discret. Math. 25(4): 1804-1811 (2011) - 2010
- [j24]Hervé Hocquard, Mickaël Montassier, André Raspaud:
A note on the acyclic 3-choosability of some planar graphs. Discret. Appl. Math. 158(10): 1104-1110 (2010) - [j23]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): 167-173 (2010) - [j22]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): 1520-1523 (2010) - [j21]Mickaël Montassier, André Raspaud, Xuding Zhu:
Decomposition of sparse graphs into two forests, one having bounded maximum degree. Inf. Process. Lett. 110(20): 913-916 (2010) - [j20]Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud:
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J. Graph Theory 65(2): 83-93 (2010) - 2009
- [j19]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): 4596-4607 (2009) - [j18]Mickaël Montassier, André Raspaud, Xuding Zhu:
An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30(2): 351-355 (2009) - [j15]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 B 99(4): 668-673 (2009) - [j13]Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang:
Star coloring of sparse graphs. J. Graph Theory 62(3): 201-219 (2009) - 2008
- [j12]Louis Esperet, Mickaël Montassier, André Raspaud:
Linear choosability of graphs. Discret. Math. 308(17): 3938-3950 (2008) - [j9]Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang:
A relaxation of Havel's 3-color problem. Inf. Process. Lett. 107(3-4): 107-109 (2008) - 2007
- [j7]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): 2141-2151 (2007) - [j6]Mickaël Montassier, André Raspaud, Weifan Wang:
Acyclic 5-choosability of planar graphs without small cycles. J. Graph Theory 54(3): 245-260 (2007) - 2006
- [j5]Mickaël Montassier, André Raspaud, Weifan Wang:
Bordeaux 3-color conjecture and 3-choosability. Discret. Math. 306(6): 573-579 (2006) - [j4]Mickaël Montassier, André Raspaud:
A note on 2-facial coloring of plane graphs. Inf. Process. Lett. 98(6): 235-241 (2006) - [j2]Mickaël Montassier, André Raspaud:
(d, 1)-total labeling of graphs with a given maximum average degree. J. Graph Theory 51(2): 93-109 (2006) - [j1]Mickaël Montassier, Pascal Ochem, André Raspaud:
On the acyclic choosability of graphs. J. Graph Theory 51(4): 281-300 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
