 | 2009 |
|---|
| 15 |       | Mickaël Montassier,
André Raspaud,
Xuding Zhu:
An upper bound on adaptable choosability of graphs.
Eur. J. Comb. 30(2): 351-355 (2009) |
| 14 | | 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): 1193-1196 (2009) |
| 2008 |
|---|
| 13 | | Louis Esperet,
Mickaël Montassier,
André Raspaud:
Linear choosability of graphs.
Discrete Mathematics 308(17): 3938-3950 (2008) |
| 12 | | Mickaël Montassier,
Pascal Ochem,
Alexandre Pinlou:
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.
Discrete Mathematics & Theoretical Computer Science 10(1): (2008) |
| 11 | | Mickaël Montassier,
Pascal Ochem,
Alexandre Pinlou:
Strong oriented chromatic number of planar graphs without cycles of specific lengths.
Electronic Notes in Discrete Mathematics 30: 27-32 (2008) |
| 10 | | 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 |
|---|
| 9 | | Mickaël Montassier:
A small non-Z4-colorable planar graph.
Discrete Mathematics 307(13): 1684-1686 (2007) |
| 8 | | Fabrice Bazzaro,
Mickaël Montassier,
André Raspaud:
(d, 1)-total labelling of planar graphs with large girth and high maximum degree.
Discrete Mathematics 307(16): 2141-2151 (2007) |
| 7 | | Mickaël Montassier,
André Raspaud,
Weifan Wang:
Acyclic 5-choosability of planar graphs without small cycles.
Journal of Graph Theory 54(3): 245-260 (2007) |
| 2006 |
|---|
| 6 | | Mickaël Montassier,
André Raspaud,
Weifan Wang:
Bordeaux 3-color conjecture and 3-choosability.
Discrete Mathematics 306(6): 573-579 (2006) |
| 5 | | Mickaël Montassier,
André Raspaud:
A note on 2-facial coloring of plane graphs.
Inf. Process. Lett. 98(6): 235-241 (2006) |
| 4 | | Mickaël Montassier:
A note on the not 3-choosability of some families of planar graphs.
Inf. Process. Lett. 99(2): 68-71 (2006) |
| 3 | | Mickaël Montassier,
André Raspaud:
(d, 1)-total labeling of graphs with a given maximum average degree.
Journal of Graph Theory 51(2): 93-109 (2006) |
| 2 | | Mickaël Montassier,
Pascal Ochem,
André Raspaud:
On the acyclic choosability of graphs.
Journal of Graph Theory 51(4): 281-300 (2006) |
| 2005 |
|---|
| 1 | | Daniel Gonçalves,
Mickaël Montassier:
Acyclic Choosability of Graphs with Small Maximum Degree.
WG 2005: 239-248 |
