Search the dblp DataBase

Publications of Author

1. Daniel Gonçalves, Mickaël Montassier
   Acyclic Choosability of Graphs with Small Maximum Degree. [Citation Graph (0, 0)][DBLP]
   WG, 2005, pp:239-248 [Conf]
   
2. Mickaël Montassier, André Raspaud, Weifan Wang
   Bordeaux 3-color conjecture and 3-choosability. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:6, pp:573-579 [Journal]
   
3. Mickaël Montassier
   A small non-Z₄-colorable planar graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:13, pp:1684-1686 [Journal]
   
4. Mickaël Montassier, André Raspaud
   A note on 2-facial coloring of plane graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:98, n:6, pp:235-241 [Journal]
   
5. Mickaël Montassier
   A note on the not 3-choosability of some families of planar graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:68-71 [Journal]
   
6. Mickaël Montassier, André Raspaud
   (d, 1)-total labeling of graphs with a given maximum average degree. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2006, v:51, n:2, pp:93-109 [Journal]
   
7. Mickaël Montassier, Pascal Ochem, André Raspaud
   On the acyclic choosability of graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2006, v:51, n:4, pp:281-300 [Journal]
   
8. Mickaël Montassier, André Raspaud, Weifan Wang
   Acyclic 5-choosability of planar graphs without small cycles. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2007, v:54, n:3, pp:245-260 [Journal]
   
9. Fabrice Bazzaro, Mickaël Montassier, André Raspaud
   (d, 1)-total labelling of planar graphs with large girth and high maximum degree. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:16, pp:2141-2151 [Journal]
   
10. 
    On two variations of identifying codes [Citation Graph (, )][DBLP]
    
    
11. 
    A note on the acyclic 3-choosability of some planar graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Linear choosability of graphs. [Citation Graph (, )][DBLP]
    
    
13. 
    On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. [Citation Graph (, )][DBLP]
    
    
14. 
    Planar graphs without adjacent cycles of length at most seven are 3-colorable. [Citation Graph (, )][DBLP]
    
    
15. 
    Decomposition of sparse graphs, with application to game coloring number. [Citation Graph (, )][DBLP]
    
    
16. 
    Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. [Citation Graph (, )][DBLP]
    
    
17. 
    An upper bound on adaptable choosability of graphs. [Citation Graph (, )][DBLP]