The SCEAS System
| |||||||

## Search the dblp DataBase
Mickaël Montassier:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Mickaël Montassier
**A small non-Z**[Citation Graph (0, 0)][DBLP]_{4}-colorable planar graph. Discrete Mathematics, 2007, v:307, n:13, pp:1684-1686 [Journal] - 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] - 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] - Mickaël Montassier, André Raspaud
**(**[Citation Graph (0, 0)][DBLP]*d*, 1)-total labeling of graphs with a given maximum average degree. Journal of Graph Theory, 2006, v:51, n:2, pp:93-109 [Journal] - 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] - 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] - 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] **On two variations of identifying codes**[Citation Graph (, )][DBLP]**A note on the acyclic 3-choosability of some planar graphs.**[Citation Graph (, )][DBLP]**Linear choosability of graphs.**[Citation Graph (, )][DBLP]**On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.**[Citation Graph (, )][DBLP]**Planar graphs without adjacent cycles of length at most seven are 3-colorable.**[Citation Graph (, )][DBLP]**Decomposition of sparse graphs, with application to game coloring number.**[Citation Graph (, )][DBLP]**Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.**[Citation Graph (, )][DBLP]**An upper bound on adaptable choosability of graphs.**[Citation Graph (, )][DBLP]
Search in 0.086secs, Finished in 0.087secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |