![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 26 | Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau: Locally identifying coloring of graphs CoRR abs/1010.5624: (2010) | |
| 21 | 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. Journal of Graph Theory 65(2): 83-93 (2010) | |
| 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) | |
| 2 | Mickaël Montassier, Pascal Ochem, André Raspaud: On the acyclic choosability of graphs. Journal of Graph Theory 51(4): 281-300 (2006) |
Selection of 5 from 37 records - Mickaël Montassier has 27 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page