Graphs & Applications
Publications of Mickaël MONTASSIER

(bibtex format)
[publications of the team]

Copyrights for some of the papers below have been transfered, or will be transfered to various publishers of journals, conferences proceedings, etc. For such papers I am required to post the following notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. Publisher's copyright policy are available at © SIAM, © ACM, © IEEE, © Springer, © Elsevier, © Ideal, © King's College.


[ 2005 | 2004 | 2003]


2005

  1. D. Gonçalves and M. Montassier. Acyclic choosability of graphs with small maximum degree. Technical Report RR-1348-05, LaBRI, 2005.

  2. D. Gonçalves and M. Montassier. Acyclic choosability of graphs with small maximum degree. In WG 2005, 31st International Workshop on Graph Theoretic Concepts in Computer Science, Metz, France, June 23-25 2005. D. Kratsch (Ed.): WG2005, LNCS 3787, pp.239-248, Springer-Verlag. Date?

  3. L. Esperet, M. Montassier, and A. Raspaud. Linear choosability of graphs. In EuroComb'05, European conference on Combinatorics, Graph Theory and Applications, Berlin, Germany, September 5-9 2005. Date?

  4. O. Delmas, F. Havet, M. Montassier, and S. Pérennes. Design of fault tolerant on-board networks. Technical Report RR-1345-05, LaBRI, 2005.

  5. M. Montassier, A. Raspaud, and W. Wang. Bordeaux 3-color conjecture and 3-choosability. Technical Report RR-1367-05, LaBRI, 2005.

  6. M. Montassier, A. Raspaud, and W. Wang. Acyclic 5-choosability of planar graphs without small cycles. Technical Report RR-1366-05, LaBRI, 2005.

  7. M. Montassier, A. Raspaud, and W. Wang. Acyclic 4-choosability of planar graphs without cycles of specific lengths. Technical Report RR-1365-05, LaBRI, 2005.

  8. F. Bazzaro, M. Montassier, and A. Raspaud. (d,1)-total labelling of planar graphs with large girth and high maximum degree. Discrete Mathematics, 2005. To appear.

  9. M. Montassier and A. Raspaud. A note on 2-facial coloring of plane graphs. Technical Report RR-1341-05, LaBRI, 2005.

  10. M. Montassier and A. Raspaud. A note on 2-facial coloring of plane graphs. Information Processing Letters, 2005. To appear.

  11. M. Montassier and A. Raspaud. (d,1)-total labelling of graphs with a given maximum average degree. Journal of Graph Theory, 2005. To appear.

  12. M. Montassier, P. Ochem, and A. Raspaud. On the acyclic choosability of graphs. Journal of Graph Theory, 2005. To appear.

  13. M. Montassier. A smaller not 3-choosable planar graph without 4- and 5-cycles. Technical Report RR-1361-05, LaBRI, 2005.

  14. M. Montassier. A note on the not 3-choosability of some families of planar graphs. Information Processing Letters, 2005. To appear.

  15. M. Montassier. Acyclic 4-choosability of planar graphs with girth at least 5. GT04 special volume in memory of Claude Berge, 2005. To appear.



2004

  1. M. Montassier, P. Ochem, and A. Raspaud. On the acyclic choosability of graphs. In GTO4 Graph Theory 2004: a conference in memory of Claude Berge, Paris, July 2004.

  2. F. Bazzaro and M. Montassier. Assignation de fréquences et étiquetage (d,1)-total dans les topologies planaires. In 6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2004), pages 27-31, Batz-sur-mer, France, 26-28 mai 2004. Institut National de Recherche en Informatique et Automatique.

  3. M. Montassier. On acyclic choosability of planar graphs with large girth. Technical Report RR-1336-04, LaBRI, 2004.

  4. M. Montassier and O. Serra. Acyclic choosability and probabilistic methods. Technical report, 2004. Manuscript.

  5. M. Montassier, P. Ochem, and A. Raspaud. On the acyclic choosability of graphs. Technical Report RR-1335-04, LaBRI, 2004.



2003

  1. Jean-Claude Bermond, Olivier Delmas, Frédéric Havet, Mickaël Montassier, and Stéphane Pérennes. Réseaux de télécommunication minimaux embarqués tolérants aux pannes. In 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003), pages 27-32, Banyuls-sur-mer, France, 12-14 mai 2003. Institut National de Recherche en Informatique et Automatique. ISBN 2-7261-1246-3.

  2. M. Montassier. Observability of recursive clique-trees. In Eurocomb03. European conference on Combinatorics, Graph Theory and Applications, pages 275-279, Prague, September 8 - 12, 2003.

  3. M. Montassier and A. Raspaud. (d,1)-total labelling of graphs with a given maximum average degree. Technical Report RR-1308-03, LaBRI, 2003.

  4. F. Bazzaro, M. Montassier, and A. Raspaud. (d,1)-total labelling of planar graphs with large girth and high maximum degree. Technical Report RR-1307-03, LaBRI, 2003.



16 décembre 2005 (24)
[home page of the team]