dblp.uni-trier.dewww.uni-trier.de

Mickaël Montassier Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
14EEMickaël Montassier, André Raspaud, Xuding Zhu: An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30(2): 351-355 (2009)
2008
13EELouis Esperet, Mickaël Montassier, André Raspaud: Linear choosability of graphs. Discrete Mathematics 308(17): 3938-3950 (2008)
12EEMickaël Montassier, Pascal Ochem, Alexandre Pinlou: Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discrete Mathematics & Theoretical Computer Science 10(1): (2008)
11EEMickaë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)
10EEMickaë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
9EEMickaël Montassier: A small non-Z4-colorable planar graph. Discrete Mathematics 307(13): 1684-1686 (2007)
8EEFabrice 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)
7EEMickaë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
6EEMickaël Montassier, André Raspaud, Weifan Wang: Bordeaux 3-color conjecture and 3-choosability. Discrete Mathematics 306(6): 573-579 (2006)
5EEMickaël Montassier, André Raspaud: A note on 2-facial coloring of plane graphs. Inf. Process. Lett. 98(6): 235-241 (2006)
4EEMickaël Montassier: A note on the not 3-choosability of some families of planar graphs. Inf. Process. Lett. 99(2): 68-71 (2006)
3EEMickaë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)
2EEMickaël Montassier, Pascal Ochem, André Raspaud: On the acyclic choosability of graphs. Journal of Graph Theory 51(4): 281-300 (2006)
2005
1EEDaniel Gonçalves, Mickaël Montassier: Acyclic Choosability of Graphs with Small Maximum Degree. WG 2005: 239-248

Coauthor Index

1Fabrice Bazzaro [8]
2Louis Esperet [13]
3Daniel Gonçalves [1]
4Pascal Ochem [2] [11] [12]
5Alexandre Pinlou [11] [12]
6André Raspaud [2] [3] [5] [6] [7] [8] [10] [13] [14]
7Weifan Wang [6] [7] [10]
8Yingqian Wang [10]
9Xuding Zhu [14]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)