## Site.Research History

Show minor edits - Show changes to markup

F. Dross, M. Montassier, and A. Pinlou.To appear in Discrete Applied Mathematics, 2018. http://arxiv.org/abs/1409.1348

F. Dross, M. Montassier, and A. Pinlou. To appear in Discrete Applied Mathematics, 2018. http://arxiv.org/abs/1409.1348

[50] Large induced forests in planar graphs with girth 4.

F. Dross, M. Montassier, and A. Pinlou.To appear in Discrete Applied Mathematics, 2018. http://arxiv.org/abs/1409.1348

Large induced forests in planar graphs with girth 4 or 5.

F. Dross, M. Montassier, and A. Pinlou.

Manuscript, September 2014. http://arxiv.org/abs/1409.1348

[49] Partitioning sparse graphs into an independent set and a forest of bounded degree.

F. Dross, M. Montassier, A. Pinlou. In Electronic Journal of Combinatorics, 25 (1):1-13, 2018. http://arxiv.org/abs/1606.04394

Partitioning sparse graphs into an independent set and a forest of bounded degree.

F. Dross, M. Montassier, A. Pinlou.

Manuscript, June 2016. http://arxiv.org/abs/1606.04394

F. Dross, M. Montassier, and A. Pinlou. To appear in European Journal of Combinatorics, 2017. http://arxiv.org/abs/1601.01523

F. Dross, M. Montassier, and A. Pinlou. In European Journal of Combinatorics, 66:81-94, 2017. http://arxiv.org/abs/1601.01523

F. Dross, M. Montassier, and A. Pinlou. To appear in Discrete Applied Mathematics, 2016. http://arxiv.org/abs/1504.01949

F. Dross, M. Montassier, and A. Pinlou. In Discrete Applied Mathematics, 214:99-107, 2016. http://arxiv.org/abs/1504.01949

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs.\\

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs.\\

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs.

F. Dross, M. Montassier, A. Pinlou.

Manuscript, May 2017. https://arxiv.org/abs/1705.11133

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak. To appear in Discussiones Mathematicae Graph Theory, 2015.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak. In Discussiones Mathematicae Graph Theory, 36(2):339-353, 2016.

[48] Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.

F. Dross, M. Montassier, and A. Pinlou. To appear in European Journal of Combinatorics, 2017. http://arxiv.org/abs/1601.01523

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.

F. Dross, M. Montassier, and A. Pinlou.

Manuscript, January 2016. http://arxiv.org/abs/1601.01523

[7] Vertex-partitions of graphs.

2016 International Conference on Graph Theory, Combinatorics, and Applications, October 29-31, 2016. Zhejiang Normal University, Jinhua, China. (here)

[21] Partitioning sparse graphs into an independent set and a forest of bounded degree.

F. Dross, M. Montassier, and A. Pinlou. In BGW2016 Bordeaux Graph Workshop, Bordeaux, France. November 7-10, 2016.

Partitioning sparse graphs into an independent set and a forest of bounded degree.

F. Dross, M. Montassier, A. Pinlou.

Manuscript, June 2016. http://arxiv.org/abs/1606.04394

A lower bound on the order of the largest induced forest in planar graphs with high girth.

F. Dross, M. Montassier, and A. Pinlou.

Manuscript, April 2015. http://arxiv.org/abs/1504.01949

[47] A lower bound on the order of the largest induced forest in planar graphs with high girth.

F. Dross, M. Montassier, and A. Pinlou. To appear in Discrete Applied Mathematics, 2016. http://arxiv.org/abs/1504.01949

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.To appear in Discrete Mathematics, 2015.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak. In Discrete Mathematics, 339(2):780-789, 2016.

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.

F. Dross, M. Montassier, and A. Pinlou.

Manuscript, January 2016. http://arxiv.org/abs/1601.01523

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud. SIAM J. Discrete Math., 27(3):1559–1574, 2013.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud. In SIAM J. Discrete Math., 27(3):1559–1574, 2013.

G. Chang, M. Montassier, A. Pêcher, and A. Raspaud. To appear in Discussiones Mathematicae Graph Theory, 34(4):723-733, 2014.

G. Chang, M. Montassier, A. Pêcher, and A. Raspaud. In Discussiones Mathematicae Graph Theory, 34(4):723-733, 2014.

M. Montassier and P. Ochem. To appear in Electronic Journal of Combinatorics, 2015. http://arxiv.org/abs/1306.0752

M. Montassier and P. Ochem. In Electronic Journal of Combinatorics, 22(1) P1.57, 2015.

P. Dorbec, M.A. Henning, M. Montassier, and J. Southey. To appear in Journal of Graph Theory, 2014.

P. Dorbec, M.A. Henning, M. Montassier, and J. Southey. In Journal of Graph Theory, 80(4):329–349, 2015.

G. Chang, M. Montassier, A. Pêcher, and A. Raspaud. To appear in Discussiones Mathematicae Graph Theory, 2013.

G. Chang, M. Montassier, A. Pêcher, and A. Raspaud. To appear in Discussiones Mathematicae Graph Theory, 34(4):723-733, 2014.

[39] On strong edge-colouring of graphs.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.

[39] On strong edge-colouring of subcubic graphs.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. In Discrete Applied Mathematics, 161(16–17):2467-2479, 2013

P. Dorbec, M. Montassier, and P. Ochem. To appear in Journal of Graph Theory, 2012.

P. Dorbec, M. Montassier, and P. Ochem. In Journal of Graph Theory, 75(1):75-90, 2014.

[20] Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.\\

[20] Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.\\

[20] Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.\\ F. Dross, M. Montassier, and A. Pinlou. In European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, Bergen, Norway. August 31-September 4, 2015.

[46] Optimal unavoidable sets of types of 3-paths for planar graphs of given girth.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.To appear in Discrete Mathematics, 2015.

Optimal unavoidable sets of types of 3-paths for planar graphs of given girth.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.

Manuscript, June 2015.

Optimal unavoidable sets of types of 3-paths for planar graphs of given girth.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.

Manuscript, June 2015.

Unavoidable 3-paths in planar graphs of given girth.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.

Manuscript, March 2015.

[45] 3-paths in graphs with bounded maximum average degree.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak. To appear in Discussiones Mathematicae Graph Theory, 2015.

3-paths in graphs with bounded maximum average degree.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.

Manuscript, February 2015.

A lower bound on the order of the largest induced forest in planar graphs with high girth.

F. Dross, M. Montassier, and A. Pinlou.

Manuscript, April 2015. http://arxiv.org/abs/1504.01949

O. Delmas, F. Havet, M. Montassier, and S. Pérennes. To appear in Theoretical Computer Science, 2014.

O. Delmas, F. Havet, M. Montassier, and S. Pérennes. In Theoretical Computer Science, 562:75-89, 2015.

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2012.

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud. In Journal of Graph Theory, 75(2):191–202, 2014.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud. To appear in SIAM Journal on Discrete Mathematics, 2013.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud. SIAM J. Discrete Math., 27(3):1559–1574, 2013.

Unavoidable 3-paths in planar graphs of given girth.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.

Manuscript, March 2015.

Entropy compression method applied to graph colorings.

Séminaire Graphes et Structures Discrètes, ENS de Lyon, 2014/05/13.

M. Montassier, P. Ochem. To appear in Electronic Journal of Combinatorics, 2015. http://arxiv.org/abs/1306.0752

M. Montassier and P. Ochem. To appear in Electronic Journal of Combinatorics, 2015. http://arxiv.org/abs/1306.0752

O. Delmas, F. Havet, M. Montassier and S. Pérennes. To appear in Theoretical Computer Science, 2014.

O. Delmas, F. Havet, M. Montassier, and S. Pérennes. To appear in Theoretical Computer Science, 2014.

P. Dorbec, M.A. Henning, M. Montassier, J. Southey. To appear in Journal of Graph Theory, 2014.

P. Dorbec, M.A. Henning, M. Montassier, and J. Southey. To appear in Journal of Graph Theory, 2014.

G. Chang, M. Montassier, A. Pêcher, A. Raspaud. To appear in Discussiones Mathematicae Graph Theory, 2013.

G. Chang, M. Montassier, A. Pêcher, and A. Raspaud. To appear in Discussiones Mathematicae Graph Theory, 2013.

T. Kaiser, M. Montassier, A. Raspaud. In SIAM Journal on Discrete Mathematics, 25(4):1804 - 1811, 2011.

T. Kaiser, M. Montassier, and A. Raspaud. In SIAM Journal on Discrete Mathematics, 25(4):1804 - 1811, 2011.

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 62(3):201-219, 2009.

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud, and W. Wang. In Journal of Graph Theory, 62(3):201-219, 2009.

M. Montassier, A. Raspaud, W. Wang and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008.

M. Montassier, A. Raspaud, W. Wang, and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008.

M. Montassier, P. Ochem and A. Pinlou. In DMTCS, 10(1):1-24, 2008.

M. Montassier, P. Ochem, and A. Pinlou. In DMTCS, 10(1):1-24, 2008.

L. Esperet, M. Montassier and A. Raspaud. In Discrete Mathematics, 308(17):3938-3950, 2008.

L. Esperet, M. Montassier, and A. Raspaud. In Discrete Mathematics, 308(17):3938-3950, 2008.

M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 54(3):245-260, 2007.

M. Montassier, A. Raspaud, and W. Wang. In Journal of Graph Theory, 54(3):245-260, 2007.

M. Montassier, A. Raspaud and W. Wang. In Discrete Mathematics, 306(6):573-579, 2006.

M. Montassier, A. Raspaud, and W. Wang. In Discrete Mathematics, 306(6):573-579, 2006.

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

M. Montassier, A. Raspaud, and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

M. Montassier, P. Ochem and A. Raspaud. In Journal of Graph Theory, 51(4):281-300, 2006.

M. Montassier, P. Ochem, and A. Raspaud. In Journal of Graph Theory, 51(4):281-300, 2006.

F. Bazzaro, M. Montassier and A. Raspaud. In Discrete Mathematics, 307(16):2141-2151, 2007. (here)

F. Bazzaro, M. Montassier, and A. Raspaud. In Discrete Mathematics, 307(16):2141-2151, 2007. (here)

D. Gonçalves, M. Montassier and A. Pinlou. ICGT 2014, 9th International colloquium on graph theory and combinatorics, Grenoble, France. June 30-July 4, 2014

D. Gonçalves, M. Montassier, and A. Pinlou. ICGT 2014, 9th International colloquium on graph theory and combinatorics, Grenoble, France. June 30-July 4, 2014

S. Chaplick, P. Dorbec, J. Kratochvil, M. Montassier and J. Stacho. In WG2014, Le Domaine de Chalès, Orléans, France. June 25-27, 2014.

S. Chaplick, P. Dorbec, J. Kratochvil, M. Montassier, and J. Stacho. In WG2014, Le Domaine de Chalès, Orléans, France. June 25-27, 2014.

M. Montassier, A. Pêcher, A. Raspaud. In EuroComb 2013, Pisa, Italy. September 9-13, 2013.

M. Montassier, A. Pêcher, and A. Raspaud. In EuroComb 2013, Pisa, Italy. September 9-13, 2013.

H. Hocquard, M. Montassier, A. Raspaud and P. Valicov. In Bordeaux Graph Workshop 2012, Bordeaux, France. November 21-24, 2012.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. In Bordeaux Graph Workshop 2012, Bordeaux, France. November 21-24, 2012.

H. Hocquard and M. Montassier. In EuroComb 2011, Rényi Institute, Budapest, Hungary. August 29-September 2, 2011.

H. Hocquard and M. Montassier. In EuroComb 2011, Rényi Institute, Budapest, Hungary. August 29-September 2, 2011.

M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

L. Esperet, S. Gravier, M. Montassier, P. Ochem and A. Parreau. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

M. Montassier, P. Ochem and A. Pinlou. LAGOS '07: Latin-American Algorithms, Graphs and Optimization Symposium. Puerto Varas, Chile, November 25-29, 2007.

M. Montassier, P. Ochem, and A. Pinlou. LAGOS '07: Latin-American Algorithms, Graphs and Optimization Symposium. Puerto Varas, Chile, November 25-29, 2007.

L. Esperet, M. Montassier and A. Raspaud. An extended abstract in EuroComb'05, European conference on Combinatorics, Graph Theory and Applications. Berlin, September 5-9, 2005. DMTCS proc. AE, 2005, p.99-104.

L. Esperet, M. Montassier, and A. Raspaud. An extended abstract in EuroComb'05, European conference on Combinatorics, Graph Theory and Applications. Berlin, September 5-9, 2005. DMTCS proc. AE, 2005, p.99-104.

F. Bazzaro, M. Montassier and A. Raspaud. In 6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2004, p.27-31, Batz-sur-mer, France, 26-28 Mai 2004. Institut National de Recherche en Informatique et Automatique. (here)

F. Bazzaro, M. Montassier, and A. Raspaud. In 6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2004, p.27-31, Batz-sur-mer, France, 26-28 Mai 2004. Institut National de Recherche en Informatique et Automatique. (here)

M. Montassier, P. Ochem and A. Raspaud. In GT'O4 Graph Theory 2004: a conference in memory of Claude Berge. Paris, July 5-9, 2004. (here)

M. Montassier, P. Ochem, and A. Raspaud. In GT'O4 Graph Theory 2004: a conference in memory of Claude Berge. Paris, July 5-9, 2004. (here)

J-C.Bermond, O. Delmas, F. Havet, M. Montassier and S. Pérennes. In 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2003, p.27-32, Banyuls-sur-mer, France, 12-14 mai 2003. Institut National de Recherche en Informatique et Automatique. ISBN 2-7261-1246-3. (here)

J-C.Bermond, O. Delmas, F. Havet, M. Montassier, and S. Pérennes. In 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2003, p.27-32, Banyuls-sur-mer, France, 12-14 mai 2003. Institut National de Recherche en Informatique et Automatique. ISBN 2-7261-1246-3. (here)

F. Dross, M. Montassier and A. Pinlou.\\

F. Dross, M. Montassier, and A. Pinlou.\\

D. Gonçalves, M. Montassier and A. Pinlou.\\

D. Gonçalves, M. Montassier, and A. Pinlou.\\

O. Delmas, F. Havet, M. Montassier and S. Pérennes.\\

O. Delmas, F. Havet, M. Montassier, and S. Pérennes.\\

L. Esperet, M. Montassier and A. Raspaud.\\

L. Esperet, M. Montassier, and A. Raspaud.\\

Near-colorings: non-colorable graphs and NP-completness.

M. Montassier, P. Ochem.

Manuscript, May 2013. http://arxiv.org/abs/1306.0752

[44] Near-colorings: non-colorable graphs and NP-completness.

M. Montassier, P. Ochem. To appear in Electronic Journal of Combinatorics, 2015. http://arxiv.org/abs/1306.0752

3-paths in graphs with bounded maximum average degree.

S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.

Manuscript, February 2015.

Manuscript, June 2014. http://arxiv.org/abs/1406.4380

Manuscript, June 2014, http://arxiv.org/abs/1406.4380. January 2015, version V2.

[43] Design of fault tolerant on-board network.

O. Delmas, F. Havet, M. Montassier and S. Pérennes. To appear in Theoretical Computer Science, 2014.

Design of fault tolerant on-board network.

O. Delmas, F. Havet, M. Montassier and S. Pérennes.

Revised version, June 2014.

[6] Entropy compression method and graph coloring problems.

C&C 2014, 23rd Workshop on Cycles and Colourings, September 7-12, 2014. Nový Smokovec, High Tatras, Slovakia. (here)

2012 International Conference on Graph Theory, Combinatorics, and Applications, 26-29 October 2012. Zhejiang Normal University, Jinhua, China, (here)

2012 International Conference on Graph Theory, Combinatorics, and Applications, October 26-29, 2012. Zhejiang Normal University, Jinhua, China. (here)

(here)

(DM)(arXiv)

(here)

(SIAM-DM)(arXiv)

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau. The Electronic Journal of Combinatorics, Volume 19, Issue 2, P40, 2012. (here)

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau. The Electronic Journal of Combinatorics, Volume 19, Issue 2, P40, 2012. (EJC) (arXiv)

Manuscript, May 2013.

Manuscript, May 2013. http://arxiv.org/abs/1306.0752

C. Charpentier, M. Montassier, and A. Raspaud. In Journal of Combinatorial Optimization, DOI:10.1007/s10878-012-9507-6, 2012.

C. Charpentier, M. Montassier, and A. Raspaud. In Journal of Combinatorial Optimization, 25(4):646-660, 2013. (here)

Manuscript, September 2014.

Manuscript, September 2014. http://arxiv.org/abs/1409.1348

Large induced forests in planar graphs with girth 4 or 5.

F. Dross, M. Montassier and A. Pinlou.

Manuscript, September 2014.

[42] Independent domination in cubic graphs.

P. Dorbec, M.A. Henning, M. Montassier, J. Southey. To appear in Journal of Graph Theory, 2014.

Independent domination in cubic graphs.

P. Dorbec, M.A. Henning, M. Montassier, J. Southey.

Manuscript, June 2013.

On some coloring problems of Graphs.\\

On some coloring problems of graphs.\\

[19] Entropy compression method applied to graph colorings.

D. Gonçalves, M. Montassier and A. Pinlou. ICGT 2014, 9th International colloquium on graph theory and combinatorics, Grenoble, France. June 30-July 4, 2014

Manuscript, June 2014.

Manuscript, June 2014. http://arxiv.org/abs/1406.4380

Entropy compression method applied to graph colorings.

D. Gonçalves, M. Montassier and A. Pinlou.

Manuscript, June 2014.

Design of fault tolerant on-board network.

O. Delmas, F. Havet, M. Montassier and S. Pérennes.

Revised version, June 2014.

[18] Contact Representations of Planar Graph: Rebuilding is Hard.

S. Chaplick, P. Dorbec, J. Kratochvil, M. Montassier and J. Stacho. In WG2014, Le Domaine de Chalès, Orléans, France. June 25-27, 2014.

G. Chang, M. Montassier, A. Pêcher, A. Raspaud. In EuroComb 2013, Pisa, Italy. September 9-13, 2013.

M. Montassier, A. Pêcher, A. Raspaud. In EuroComb 2013, Pisa, Italy. September 9-13, 2013.

[17] Strong chromatic index of planar graphs with large girth.

G. Chang, M. Montassier, A. Pêcher, A. Raspaud. In EuroComb 2013, Pisa, Italy. September 9-13, 2013.

[41] Strong chromatic index of planar graphs with large girth.

G. Chang, M. Montassier, A. Pêcher, A. Raspaud. To appear in Discussiones Mathematicae Graph Theory, 2013.

Strong chromatic index of planar graphs with large girth.

G. Chang, M. Montassier, A. Pêcher, A. Raspaud.

Manuscript, April 2013.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud.To appear in SIAM Journal on Discrete Mathematics, 2013.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud. To appear in SIAM Journal on Discrete Mathematics, 2013.

[40] Generalized Power Domination in Regular Graphs.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud.To appear in SIAM Journal on Discrete Mathematics, 2013.

Generalized Power Domination in Regular Graphs.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud.

Manuscript, September 2012.

Independent domination in cubic graphs.

P. Dorbec, M.A. Henning, M. Montassier, J. Southey.

Manuscript, June 2013.

Near-colorings: non-colorable graphs and NP-completness.

M. Montassier, P. Ochem.

Manuscript, May 2013.

Strong chromatic index of planar graphs with large girth.

G. Chang, M. Montassier, A. Pêcher, A. Raspaud.

Manuscript, April 2013.

(here)

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou. In Journal of Graph Theory, 73(1):85-102, 2013.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou. In Journal of Graph Theory, 73(1):85-102, 2013. (here)

(here)

(here)

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics, 159(17):1947 - 1953, 2011.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics, 159(17):1947 - 1953, 2011. (here)

(here)

(here)

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu. In Journal of Combinatorial Theory, Series B, 102(1):38-52, 2012.

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu. In Journal of Combinatorial Theory, Series B, 102(1):38-52, 2012. (here)

(here)

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou. In Journal of Graph Theory, DOI: 10.1002/jgt.21659, 2012.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou. In Journal of Graph Theory, 73(1):85-102, 2013.

Méthode de compression et colorations de graphes.

Séminaire Graphes et Applications, LaBRI, Bordeaux. 2013/02/10.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.\\

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2012.\\

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2012.

P. Dorbec, M. Montassier, and P. Ochem. To appear in Journal of Graph Theory, 2012.\\

P. Dorbec, M. Montassier, and P. Ochem. To appear in Journal of Graph Theory, 2012.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.\\

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2012.

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2012.\\

P. Dorbec, M. Montassier, and P. Ochem. To appear in Journal of Graph Theory, 2012.

P. Dorbec, M. Montassier, and P. Ochem. To appear in Journal of Graph Theory, 2012.\\

C. Charpentier, M. Montassier, and A. Raspaud. To appear in Journal of Combinatorial Optimization, 2012.

C. Charpentier, M. Montassier, and A. Raspaud. In Journal of Combinatorial Optimization, DOI:10.1007/s10878-012-9507-6, 2012.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2012.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics, 160(12):1691 - 1698, 2012.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou. To appear in Journal of Graph Theory, 2012.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou. In Journal of Graph Theory, DOI: 10.1002/jgt.21659, 2012.

H. Hocquard and M. Montassier. To appear in Journal of Combinatorial Optimization, 2011.

H. Hocquard and M. Montassier. In Journal of Combinatorial Optimization, DOI:10.1007/s10878-011-9444-9, 2012.

T. Kaiser, M. Montassier, A. Raspaud. To appear in SIAM Journal on Discrete Mathematics, 2011.

T. Kaiser, M. Montassier, A. Raspaud. In SIAM Journal on Discrete Mathematics, 25(4):1804 - 1811, 2011.

[39] On strong edge-colouring of graphs.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.

On strong edge-colouring of graphs.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov.

Manuscript, April 2012.

[38] Limits of near-coloring of sparse graphs.

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2012.

Limits of near-coloring of sparse graphs.

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud.

Manuscript, March 2012.

[37] Vertex-partitions of graphs into cographs and stars.

P. Dorbec, M. Montassier, and P. Ochem. To appear in Journal of Graph Theory, 2012.

[16] A note on strong edge-colouring.

H. Hocquard, M. Montassier, A. Raspaud and P. Valicov. In Bordeaux Graph Workshop 2012, Bordeaux, France. November 21-24, 2012.

Vertex-partitions of graphs into cographs and stars.

P. Dorbec, M. Montassier, and P. Ochem.

Manuscript, July 2011.

[5] Limits of near-coloring of sparse graphs.

2012 International Conference on Graph Theory, Combinatorics, and Applications, 26-29 October 2012. Zhejiang Normal University, Jinhua, China, (here)

Steinberg's Conjecture and near-colorings.

G.J. Chang, F. Havet, M. Montassier, and A. Raspaud.

Manuscript, July 2011.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud.\\

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov.\\

## Conferences, invited talks

## Conferences, invited talks

## Research Report

## Research Reports

Generalized Power Domination in Regular Graphs.

P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud.
Manuscript, September 2012.

## Research Report

Steinberg's Conjecture and near-colorings.

G.J. Chang, F. Havet, M. Montassier, and A. Raspaud.

Research Report RR-7669, INRIA, 7 2011.

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau. The Electronic Journal of Combinatorics, Volume 19, Issue 2, P40, 2012.

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau. The Electronic Journal of Combinatorics, Volume 19, Issue 2, P40, 2012. (here)

[36] Locally identifying coloring of graphs.

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau. The Electronic Journal of Combinatorics, Volume 19, Issue 2, P40, 2012.

Locally identifying coloring of graphs.

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau.

Manuscript, October 2010.

[35] L(p,q)-labeling of sparse graphs.

C. Charpentier, M. Montassier, and A. Raspaud. To appear in Journal of Combinatorial Optimization, 2012.

L(p,q)-labeling of sparse graphs.

C. Charpentier, M. Montassier, and A. Raspaud.

Manuscript, June 2011.

On strong edge-colouring of graphs.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov.
Manuscript, April 2012.

Limits of near-coloring of sparse graphs.

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud.

Manuscript, March 2012.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud. To appear Discrete Applied Mathematics, 2012.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2012.

[34] Generalized power domination of graphs.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud. To appear Discrete Applied Mathematics, 2012.

Generalized power domination of graphs.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud.

Manuscript, November 2010.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang. To appear in Journal of Combinatorial Optimization, 2010. (here)

Y. Bu, M. Montassier, A. Raspaud, and W. Wang. In Journal of Combinatorial Optimization, 23(1):79-93, 2012. (here)

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics, 159(17):1947 - 1953, 2011.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics, 159(17):1947 - 1953, 2011.

O. Delmas, S. Gravier, M. Montassier, and A. Parreau. In Discrete Mathematics, 311(17):1948-1956, 2011.

O. Delmas, S. Gravier, M. Montassier, and A. Parreau. In Discrete Mathematics, 311(17):1948 - 1956, 2011.

M. Chen, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2011.

M. Chen, M. Montassier, and A. Raspaud. In Discrete Mathematics, 312(2):362-373, 2012.

O. Delmas, S. Gravier, M. Montassier, and A. Parreau. To appear in Discrete Mathematics, 2011.

O. Delmas, S. Gravier, M. Montassier, and A. Parreau. In Discrete Mathematics, 311(17):1948-1956, 2011.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. In Discrete Mathematics, 312(6):1128-1135, 2012.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics, 159(17):1947--1953, 2011.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2011.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics, 159(17):1947--1953, 2011.

[33] A complexity dichotomy for the coloring of sparse graphs.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou. To appear in Journal of Graph Theory, 2012.

A complexity dichotomy for the coloring of sparse graphs.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou.

Manuscript, January 2011.

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu. To appear in Journal of Combinatorial Theory, Series B.

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu. In Journal of Combinatorial Theory, Series B, 102(1):38-52, 2012.

JGA 2011, Journées Graphes et Algorithmes 2011, Université Lyon 1, Lyon, France. (here)

JGA 2011, Journées Graphes et Algorithmes, 16-18 Novembre 2011. Université Lyon 1, Lyon, France. (here)

[4] Le problème des 3 couleurs et la conjecture de Steinberg.

JGA 2011, Journées Graphes et Algorithmes 2011, Université Lyon 1, Lyon, France. (here)

[32] Adjacent vertex-distinguishing edge coloring of graphs.

H. Hocquard and M. Montassier. To appear in Journal of Combinatorial Optimization, 2011.

Adjacent vertex-distinguishing edge coloring of graphs.

H. Hocquard and M. Montassier.

Manuscript, May 2011.

[31 ]Covering a graph by forests and a matching.\\

[31] Covering a graph by forests and a matching.\\

[31 ]Covering a graph by forests and a matching.

T. Kaiser, M. Montassier, A. Raspaud. To appear in SIAM Journal on Discrete Mathematics, 2011.

Covering a graph by forests and a matching.

T. Kaiser, M. Montassier, A. Raspaud, and O. Rucky

Manuscript, July 2010.

Steinberg's Conjecture and near-colorings.

G.J. Chang, F. Havet, M. Montassier, and A. Raspaud.

Manuscript, July 2011.

Vertex-partitions of graphs into cographs and stars.

P. Dorbec, M. Montassier, and P. Ochem.

Manuscript, July 2011.

L(p,q)-labeling of sparse graphs.

C. Charpentier, M. Montassier, and A. Raspaud.

Manuscript, June 2011.

Some remarks on the Three Color Problem.

V.A. Aksenov, O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud.

Manuscript, January 2010.

(k,j)-coloring of sparse graphs.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.

Manuscript, January 2010.

[30] (k,j)-coloring of sparse graphs.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2011.

[29] On two variations of identifying codes.

O. Delmas, S. Gravier, M. Montassier, and A. Parreau. To appear in Discrete Mathematics, 2011.

On two variations of identifying codes.

O. Delmas, S. Gravier, M. Montassier, and A. Parreau.

Manuscript, March 2010.

Adjacent vertex-distinguishing edge coloring of graphs.

H. Hocquard and M. Montassier.

Manuscript, May 2011.

[15] Minmax degree of graphs.\\

[15] Minmax degree of planar graphs.\\

[15] Minmax degree of graphs.

C. Charpentier, M. Montassier, and A. Raspaud. In EuroComb 2011, Rényi Institute, Budapest, Hungary. August 29-September 2, 2011.

[14] Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five.

H. Hocquard and M. Montassier. In EuroComb 2011, Rényi Institute, Budapest, Hungary. August 29-September 2, 2011.

[13]Covering a graph by forests and a matching.\\

[13] Covering a graph by forests and a matching.\\

[13]Covering a graph by forests and a matching.

T. Kaiser, M. Montassier, A. Raspaud, and O. Rucky. In CanaDAM 2011, University of Victoria, BC, Canada. May 31-June 3, 2011.

[28] Some structural properties of planar graphs and their applications to 3-choosability.

M. Chen, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2011.

Some structural properties of planar graphs and their applications to 3-choosability.

M. Chen, M. Montassier, and A. Raspaud.

Manuscript, March 2009. Research Report RR-1455-09.

Vertex-partitions of graphs into cographs and stars.

Séminaire AlGCo, LIRMM, Montpellier. 2011/03/24.

Vertex-partitions of graphs into cographs and stars.

GRATEL meeting, National Taipei University, Taipei, Taiwan. 2011/03/12.

T. Kaiser, M. Montassier, and A. Raspaud.\\

T. Kaiser, M. Montassier, A. Raspaud, and O. Rucky \\

[27] Decomposing graphs into forests.

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu. To appear in Journal of Combinatorial Theory, Series B.

Decomposing graphs into forests.

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu.

Manuscript, March 2010.

A complexity dichotomy for the coloring of sparse graphs.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou.

Manuscript, January 2011.

Nine Dragon Tree Conjectures.

GRATOS meeting, LIRMM, Montpellier. 2010/12/09.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang. In Journal of Combinatorial Optimization. (here)

Y. Bu, M. Montassier, A. Raspaud, and W. Wang. To appear in Journal of Combinatorial Optimization, 2010. (here)

Y. Bu, M. Montassier, A. Raspaud, and W. Wang. To appear in Journal of Combinatorial Optimization.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang. In Journal of Combinatorial Optimization. (here)

M. Montassier, A. Raspaud, and X. Zhu. In Information Processing Letters, 110(20):913-916, 2010.

M. Montassier, A. Raspaud, and X. Zhu. In Information Processing Letters, 110(20):913-916, 2010. (here)

M. Montassier, A. Raspaud, and X. Zhu. To appear in Information Processing Letters.

M. Montassier, A. Raspaud, and X. Zhu. In Information Processing Letters, 110(20):913-916, 2010.

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158:1104-1110, 2010.

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158(10):1104-1110, 2010. (here)

(here)

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520--1523, 2010.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520-1523, 2010.

(here)

O.V. Borodin, M. Montassier, and A. Raspaud. In Discrete Mathematics, 310(1):167--173, 2010.

O.V. Borodin, M. Montassier, and A. Raspaud. In Discrete Mathematics, 310(1):167-173, 2010.

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 54:245-260, 2007.

M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 54(3):245-260, 2007. (here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

F. Bazzaro, M. Montassier and A. Raspaud. In Discrete Mathematics, 307(16):2141-2151, 2007.

F. Bazzaro, M. Montassier and A. Raspaud. In Discrete Mathematics, 307(16):2141-2151, 2007. (here)

M. Montassier, A. Raspaud, and X. Zhu. To appear in Information Processing Letters. (here)

M. Montassier, A. Raspaud, and X. Zhu. To appear in Information Processing Letters.

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158:1104-1110, 2010. (here)

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158:1104-1110, 2010.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520--1523, 2010. (here)

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520--1523, 2010.

O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. In Journal of Graph Theory, 65(2):83-93, 2010. (here)

O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. In Journal of Graph Theory, 65(2):83-93, 2010.

O.V. Borodin, M. Montassier, and A. Raspaud. In Discrete Mathematics, 310(1):167--173, 2010. (here)

O.V. Borodin, M. Montassier, and A. Raspaud. In Discrete Mathematics, 310(1):167--173, 2010.

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009.

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. In Discrete Mathematics 309(13):4596-4607, 2009. (here)

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. In Discrete Mathematics 309(13):4596-4607, 2009.

L. Esperet, M. Montassier, and X. Zhu. In Journal of Graph Theory, 62(2):127-138, 2009. (here)

L. Esperet, M. Montassier, and X. Zhu. In Journal of Graph Theory, 62(2):127-138, 2009.

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 62(3):201-219, 2009. (here)

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 62(3):201-219, 2009.

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. In Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009. (here)

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. In Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009.

M. Montassier, A. Raspaud, and X. Zhu. In European Journal of Combinatorics, 30(2):351-355, 2009. (here)

M. Montassier, A. Raspaud, and X. Zhu. In European Journal of Combinatorics, 30(2):351-355, 2009.

M. Montassier, A. Raspaud, W. Wang and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008. (here)

M. Montassier, A. Raspaud, W. Wang and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008.

(here)

(here)

(here)

(here)

(here)

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006. (here)

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

(here)

(here)

M. Montassier. Trends in Mathematics: Graph Theory in Paris, 299-310, 2007. (here)

M. Montassier. Trends in Mathematics: Graph Theory in Paris, 299-310, 2007.

(here)

(here)

(here)

Reviewer: F. Havet, A. Kostochka, and C. Thomassen.\\

Reviewers: F. Havet, A. Kostochka, and C. Thomassen.\\

G. J. Chang, P. Dorbec, M. Montassier and A. Raspaud.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud.

G. J. Chang, P. Dorbec, M. Montassier and A. Raspaud.\\

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud.\\

Reviewer: ->F. Havet, A. Kostochka, and C. Thomassen. Jury: ->F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.

Reviewer: F. Havet, A. Kostochka, and C. Thomassen.

Jury: F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.

Reviewer:

Jury:

Reviewer: ->F. Havet, A. Kostochka, and C. Thomassen. Jury: ->F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.

F. Havet, A. Kostochka, and C. Thomassen

F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.

[>>]F. Havet, A. Kostochka, and C. Thomassen

Jury: F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.

F. Havet, A. Kostochka, and C. Thomassen

Jury:

F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.

Reviewer: F. Havet, A. Kostochka, and C. Thomassen\\

Reviewer: [>>]F. Havet, A. Kostochka, and C. Thomassen\\

## Habilitation à diriger des recherches

On some coloring problems of Graphs. November 17, 2010.\\

## "Habilitation à diriger des recherches"

On some coloring problems of Graphs.

November 17, 2010.\\

JGA'03, LE2I, Dijon, France. 2003/04/3.

Generalized power domination of graphs.

G. J. Chang, P. Dorbec, M. Montassier and A. Raspaud.

Manuscript, November 2010.

Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, and Aline Parreau.\\

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau.\\

Locally identifying coloring of graphs.

Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, and Aline Parreau.

Manuscript, October 2010.

O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. To appear in Journal of Graph Theory, 2009.

O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. In Journal of Graph Theory, 65(2):83-93, 2010. (here)

M. Montassier, A. Raspaud, and X. Zhu. To appear in Information Processing Letters.

M. Montassier, A. Raspaud, and X. Zhu. To appear in Information Processing Letters. (here)

H. Hocquard and M. Montassier. An extended abstract in EuroComb'09, European conference on Combinatorics, Graph Theory and Applications. Bordeaux September 7-11, 2009. (here)

H. Hocquard and M. Montassier. An extended abstract in EuroComb'09, European conference on Combinatorics, Graph Theory and Applications. Bordeaux September 7-11, 2009. (here)

(here)

(here)

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520--1523, 2010. (here)

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520--1523, 2010. (here)

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158:1104-1110, 2010. (here)

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158:1104-1110, 2010. (here)

O.V. Borodin, M. Montassier, and A. Raspaud. In Discrete Mathematics, 310(1):167--173, 2010. (here)

O.V. Borodin, M. Montassier, and A. Raspaud. In Discrete Mathematics, 310(1):167--173, 2010. (here)

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. In Discrete Mathematics 309(13):4596-4607, 2009. (here)

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. In Discrete Mathematics 309(13):4596-4607, 2009. (here)

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. In Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009. (here)

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. In Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009. (here)

M. Montassier, A. Raspaud, and X. Zhu. In European Journal of Combinatorics, 30(2):351-355, 2009. (here)

M. Montassier, A. Raspaud, and X. Zhu. In European Journal of Combinatorics, 30(2):351-355, 2009. (here)

M. Montassier, A. Raspaud, W. Wang and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008. (here)

M. Montassier, A. Raspaud, W. Wang and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008. (here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

[5] A note on 2-facial coloring of plane graphs.

M. Montassier and A. Raspaud. In Information Processing Letters, 98(6):235-241, 2006.

[5] A note on 2-facial coloring of plane graphs.

M. Montassier and A. Raspaud. In Information Processing Letters, 98(6):235-241, 2006.
(here)

(here)

(here)

(here)

(here)

[26] (k,1)-coloring of sparse graphs.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics.

(k,1)-coloring of sparse graphs.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.

Manuscript, October 2009. Research Report RR-1465-09.

[25] Backbone coloring of graphs.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang. To appear in Journal of Combinatorial Optimization.

Backbone coloring of graphs.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang.

Manuscript, January 2008.

[24] Decomposition of sparse graphs into two forests, one having bounded maximum degree.

M. Montassier, A. Raspaud, and X. Zhu. To appear in Information Processing Letters.

Decomposition of sparse graphs into two forests, one having bounded maximum degree.

M. Montassier, A. Raspaud, and X. Zhu.

Manuscript, February 2010.

Mickael Montassier, Patrice Ossona de Mendez, Andre Raspaud and Xuding Zhu. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem and Aline Parreau. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

L. Esperet, S. Gravier, M. Montassier, P. Ochem and A. Parreau. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

Gerard Jennhwa Chang, Paul Dorbec, Mickael Montassier and André Raspaud.

G. J. Chang, P. Dorbec, M. Montassier and A. Raspaud.

Hervé Hocquard and M. Montassier. An extended abstract in EuroComb'09, European conference on Combinatorics, Graph Theory and Applications. Bordeaux September 7-11, 2009. (here)

H. Hocquard and M. Montassier. An extended abstract in EuroComb'09, European conference on Combinatorics, Graph Theory and Applications. Bordeaux September 7-11, 2009. (here)

Covering a graph by forests and a matching.

T. Kaiser, M. Montassier, and A. Raspaud.

Manuscript, July 2010.

[12] Decomposing a graph into forests.\\

[12] Decomposing a graph into forests.\\

[12] Decomposing a graph into forests.\\ Mickael Montassier, Patrice Ossona de Mendez, Andre Raspaud and Xuding Zhu. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

[11] Identifying colorings of graphs.

Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem and Aline Parreau. In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

[10] Generalized power domination.

Gerard Jennhwa Chang, Paul Dorbec, Mickael Montassier and André Raspaud.
In 8FCC: 8th French Combinatorial Conference. Université Paris Sud. June 28-July 2, 2010.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520--1523, 2010

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158:1104-1110, 2010.

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2010.

H. Hocquard, M. Montassier, and A. Raspaud. In Discrete Applied Mathematics 158:1104-1110, 2010.

[2] Decomposition of sparse graphs, with applications to game coloring number.

2010 Workshop on Graph Theory, March 19-20, 2010, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. (here)

[3] Decomposition of sparse graphs, with applications to game coloring number.

2010 Seminar on Graph Theory, March 19-20, 2010, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. (here)

[2] Decomposition of sparse graphs, with applications to game coloring number.

2010 Workshop on Graph Theory, March 19-20, 2010, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. (here)

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. To appear in Discrete Mathematics, 2010.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. In Discrete Mathematics 310(10-11):1520--1523, 2010

Near-coloring of sparse graphs.

Tamkang University, Taipei, Taiwan. 2010/03/16.

Decomposition of sparse graphs into two forests, one having bounded maximum degree.

M. Montassier, A. Raspaud, and X. Zhu.

Manuscript, February 2010.

Decomposing graphs into forests.

M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu.

Manuscript, March 2010.

On two variations of identifying codes.

O. Delmas, S. Gravier, M. Montassier, and A. Parreau.

Manuscript, March 2010.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.\\

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.\\

Backbone coloring of graphs.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang.

Manuscript, January 2008.

Backbone coloring of graphs.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang.

Manuscript, January 2008.

(k,j)-coloring of sparse graphs.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.

Manuscript, January 2010.

Design of fault tolerant on-board network.

O. Delmas, F. Havet, M. Montassier and S. Pérennes.

Research Report RR-1345-05. Revised version, January 2010.

Some remarks on the Three Color Problem.

V.A. Aksenov, O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud.

Manuscript, January 2010.

O. V. Borodin, A. O. Ivanova, M. Montassier, and A. Raspaud.\\

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.\\

Design of fault tolerant on-board network.

O. Delmas, F. Havet, M. Montassier and S. Pérennes.

Research Report RR-1345-05

Revised version, December 2007.

H. Hocquard and M. Montassier. Research report RR-1450-08. Revised version, 2010.

H. Hocquard and M. Montassier.

Research report RR-1450-08. Revised version, 2010.

Acyclic coloring of graphs with maximum degree five.

H. Hocquard and M. Montassier. Research report RR-1450-08. Revised version, 2010.

University of Ilmenau, Ilmenau, Germany. 2008/10/29. http://www.tu-ilmenau.de/fakmn/Math-einzelne-News.806.0.html?&cHash=1a251b52f3&tx_ttnews[backPid]=807&tx_ttnews[pS]=1207707696&tx_ttnews[pointer]=14&tx_ttnews[tt_news]=1816 |

University of Ilmenau, Ilmenau, Germany. 2008/10/29.

University of Ilmenau, Ilmenau, Germany. 2008/10/29. http://www.tu-ilmenau.de/fakmn/Math-einzelne-News.806.0.html?&cHash=1a251b52f3&tx_ttnews[backPid]=807&tx_ttnews[pS]=1207707696&tx_ttnews[pointer]=14&tx_ttnews[tt_news]=1816|

University of Ilmenau, Ilmenau, Germany. 2008/10/29. http://www.tu-ilmenau.de/fakmn/Math-einzelne-News.806.0.html?&cHash=1a251b52f3&tx_ttnews[backPid]=807&tx_ttnews[pS]=1207707696&tx_ttnews[pointer]=14&tx_ttnews[tt_news]=1816 |

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. http://mail.math.nsysu.edu.tw/~comb/2009/

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. (here)

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01. http://mail.math.nsysu.edu.tw/~comb/2008/

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01. (here)

M. Montassier, P. Ochem and A. Raspaud. In GT'O4 Graph Theory 2004: a conference in memory of Claude Berge. Paris, July 5-9, 2004.

M. Montassier, P. Ochem and A. Raspaud. In GT'O4 Graph Theory 2004: a conference in memory of Claude Berge. Paris, July 5-9, 2004. (here)

M. Montassier. In Eurocomb'03. European conference on Combinatorics, Graph Theory and Applications. Prague, September 8-12, 2003.

M. Montassier. In Eurocomb'03. European conference on Combinatorics, Graph Theory and Applications. Prague, September 8-12, 2003. (here)

J-C.Bermond, O. Delmas, F. Havet, M. Montassier and S. Pérennes. In 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2003, p.27-32, Banyuls-sur-mer, France, 12-14 mai 2003. Institut National de Recherche en Informatique et Automatique. ISBN 2-7261-1246-3.

J-C.Bermond, O. Delmas, F. Havet, M. Montassier and S. Pérennes. In 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2003, p.27-32, Banyuls-sur-mer, France, 12-14 mai 2003. Institut National de Recherche en Informatique et Automatique. ISBN 2-7261-1246-3. (here)

F. Bazzaro, M. Montassier and A. Raspaud. In 6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2004, p.27-31, Batz-sur-mer, France, 26-28 Mai 2004. Institut National de Recherche en Informatique et Automatique.

F. Bazzaro, M. Montassier and A. Raspaud. In 6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2004, p.27-31, Batz-sur-mer, France, 26-28 Mai 2004. Institut National de Recherche en Informatique et Automatique. (here)

M. Montassier. A survey in CS06, Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, July 10-15, 2006.

M. Montassier. A survey in CS06, Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, July 10-15, 2006. (here)

(here)

D. Gonçalves and M. Montassier. 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, p.239-248, Springer-Verlag.

D. Gonçalves and M. Montassier. 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, p.239-248, Springer-Verlag. (here)

Graph Theory 2009 , Fredericia, Denmark. 2009/11/27. http://www.imada.sdu.dk/~btoft/GT2009/

Graph Theory 2009 , Fredericia, Denmark. 2009/11/27. (here)

LIRMM, Montpellier, France. 2009/11/12. http://www.lirmm.fr/algco/GT/archives-09-10.html#12_11_09

LIRMM, Montpellier, France. 2009/11/12. (here)

LIRMM, Montpellier, France. 2009/10/16.

LIRMM, Montpellier, France. 2009/10/16.(here)

University of Ilmenau, Ilmenau, Germany. 2008/10/29.

University of Ilmenau, Ilmenau, Germany. 2008/10/29. http://www.tu-ilmenau.de/fakmn/Math-einzelne-News.806.0.html?&cHash=1a251b52f3&tx_ttnews[backPid]=807&tx_ttnews[pS]=1207707696&tx_ttnews[pointer]=14&tx_ttnews[tt_news]=1816|

JGA'07, Institut Henri Poincaré, Paris. 2007/11/08.

JGA'07, Institut Henri Poincaré, Paris. 2007/11/08. (here)

JGA'04, Laboratoire Leibniz, Grenoble, France. 2004/09/29.

JGA'04, Laboratoire Leibniz, Grenoble, France. 2004/09/29. (here)

Séminaire MASCOTTE, INRIA, Sophia-Antipolis, France. 2004/02/17.

Séminaire MASCOTTE, INRIA, Sophia-Antipolis, France. 2004/02/17. (here)

LIRMM, Montpellier, France. 2009/11/12.

LIRMM, Montpellier, France. 2009/11/12. http://www.lirmm.fr/algco/GT/archives-09-10.html#12_11_09

Graph Theory 2009 , Fredericia, Denmark. 2009/11/27.

Graph Theory 2009 , Fredericia, Denmark. 2009/11/27. http://www.imada.sdu.dk/~btoft/GT2009/

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006. (here)

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan.

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. http://mail.math.nsysu.edu.tw/~comb/2009/

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01.

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01. http://mail.math.nsysu.edu.tw/~comb/2008/

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009.

O.V. Borodin, M. Montassier, and A. Raspaud. In Discrete Mathematics, 310(1):167--173, 2010. (here)

A note on the acyclic 3-choosability of some planar graphs.

H. Hocquard, M. Montassier, and A. Raspaud.

Manuscript, August 2009. Research Report RR-1463-09.

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2010.

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2010.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. To appear in Discrete Mathematics, 2010.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. To appear in Discrete Mathematics, 2010.

O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. To appear in Journal of Graph Theory, 2009.

O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. To appear in Journal of Graph Theory, 2009.

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009.

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009.

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)

L. Esperet, M. Montassier, and X. Zhu. In Journal of Graph Theory, 62(2):127-138, 2009. (here)

L. Esperet, M. Montassier, and X. Zhu. In Journal of Graph Theory, 62(2):127-138, 2009. (here)

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 62(3):201-219, 2009. (here)

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 62(3):201-219, 2009. (here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

(here)

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

(here)

(here)

(here)

(here)

M. Montassier. Trends in Mathematics: Graph Theory in Paris, 299-310, 2007. (here)

M. Montassier. Trends in Mathematics: Graph Theory in Paris, 299-310, 2007. (here)

(here)

(here)

(here)\\

(here)

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. To appear in Discrete Mathematics, 2010.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. To appear in Discrete Mathematics, 2010.\\

O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. To appear in Journal of Graph Theory, 2009.\\

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009.

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009.\\

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)\\

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. In Discrete Mathematics 309(13):4596-4607, 2009. (here)\\

L. Esperet, M. Montassier, and X. Zhu. In Journal of Graph Theory, 62(2):127-138, 2009. (here)

L. Esperet, M. Montassier, and X. Zhu. In Journal of Graph Theory, 62(2):127-138, 2009. (here)\\

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 62(3):201-219, 2009. (here)\\

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. In Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009. (here)\\

M. Montassier, A. Raspaud, and X. Zhu. In European Journal of Combinatorics, 30(2):351-355, 2009. (here)\\

M. Montassier, A. Raspaud, W. Wang and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008. (here)\\

(here)

(here)\\

(here)

(here)\\

(here)

(here)\\

(here)

(here)\\

(here)

(here)\\

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.\\

(here)

(here)\\

(here)

(here)\\

M. Montassier. Trends in Mathematics: Graph Theory in Paris, 299-310, 2007. (here)

M. Montassier. Trends in Mathematics: Graph Theory in Paris, 299-310, 2007. (here)\\

(here)

(here)\\

(here)

(here)\\

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2010.

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2010.\\

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics.

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics, 2010.

[23]A note on the acyclic 3-choosability of some planar graphs.

H. Hocquard, M. Montassier, and A. Raspaud.

Manuscript, August 2009. Research Report RR-1463-09.

[23] A note on the acyclic 3-choosability of some planar graphs.

H. Hocquard, M. Montassier, and A. Raspaud. To appear in Discrete Applied Mathematics.

A note on the acyclic 3-choosability of some planar graphs.\\

[23]A note on the acyclic 3-choosability of some planar graphs.\\

A note on the acyclic 3-choosability of some planar graphs.

H. Hocquard, M. Montassier, and A. Raspaud.

Manuscript, August 2009. Research Report RR-1463-09.

[22] Decomposition of sparse graphs, with application to game coloring number.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu. To appear in Discrete Mathematics, 2010.

Edge-partitions of sparse graphs and their applications to game coloring.

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu.

Manuscript, March 2009. Research Report RR-1453-09.

Near coloring of sparse graphs.\\

(k,j)-coloring of sparse graphs.\\

Near coloring of sparse graphs.

Graph Theory 2009 , Fredericia, Denmark. 2009/11/27.

Near coloring of sparse graphs\\

Near coloring of sparse graphs.\\

The 3-Color Problem\\

The 3-Color Problem.\\

A relaxation of Havel's Problem\\

A relaxation of Havel's Problem.\\

Acyclic coloring of graph with maximum degree five.

H. Hocquard and M. Montassier.

Manuscript, November 2008. Research Report RR-1450-08.

Decomposition of sparse graphs, application to game coloring number.

LIRMM, Montpellier, France. 2009/11/12.

Manuscript, October 2009. Research Report RR-xxxx-xx.

Manuscript, October 2009. Research Report RR-1465-09.

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22)1193-1196, 2009. (here)

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22):1193-1196, 2009. (here)

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. To appear in Journal of Graph Theory, 2008.

H. Hocquard and M. Montassier. To appear in Information Processing Letters, 2009.

H. Hocquard and M. Montassier. In Information Processing Letters, 109(21-22)1193-1196, 2009. (here)

(k,1)-coloring of sparse graphs.

O. V. Borodin, A. O. Ivanova, M. Montassier, and A. Raspaud.

Manuscript, October 2009. Research Report RR-xxxx-xx.

A note on the acyclic 3-choosability of some planar graphs.

H. Hocquard, M. Montassier, and A. Raspaud.

Manuscript, August 2009. Research Report RR-1463-09.

M. Montassier, A. Pêcher, A. Raspaud, D. West and X. Zhu.\\

M. Montassier, A. Pêcher, A. Raspaud, D. West, and X. Zhu.\\

M. Montassier, A. Pêcher, A. Raspaud, and X. Zhu.\\

M. Montassier, A. Pêcher, A. Raspaud, D. West and X. Zhu.\\

Near coloring of sparse graphs

LIRMM, Montpellier, France. 2009/10/16.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2009.

Hervé Hocquard and M. Montassier. An extended abstract in EuroComb'09, European conference on Combinatorics, Graph Theory and Applications. Bordeaux September 7-11, 2009.

Hervé Hocquard and M. Montassier. An extended abstract in EuroComb'09, European conference on Combinatorics, Graph Theory and Applications. Bordeaux September 7-11, 2009. (here)

L. Esperet, M. Montassier, and X. Zhu. To appear in Journal of Graph Theory, 2008.

L. Esperet, M. Montassier, and X. Zhu. In Journal of Graph Theory, 62(2):127-138, 2009. (here)

[21] Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. To appear in Journal of Graph Theory, 2009.

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.

Manuscript, March 2009. Research Report RR-1458-09.

## International journals

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009..

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009.

[20] Planar graphs without adjacent cycles of length at most seven are 3-colorable.

O.V. Borodin, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics, 2009..

Planar graphs without adjacent cycles of length at most seven are 3-colorable.

O.V. Borodin, M. Montassier, and A. Raspaud.

Manuscript, June 2008. Research Report RR-1446-08.

[19] Every planar graph without cycles of length 4 to 12 is acyclically 3-choosable.

H. Hocquard and M. Montassier. To appear in Information Processing Letters, 2009.

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. To appear in Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009. (here)

Every planar graph without cycles of length 4 to 12 is acyclically 3-choosable.

H. Hocquard and M. Montassier.

Manuscript, June 2009. Research Report RR-1462-09.

Manuscript, June 2009. Research Report RR-xxxx-09.

Manuscript, June 2009. Research Report RR-1462-09.

## Conferences (invited)

## Conferences, invited talks

## Conferences invité

## Conferences (invited)

## Conferences invité

[2] The 3-Color Problem.

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan.

[1] Adaptive choosability of planar graphs.

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01.

The 3-Color Problem.

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan.

Adaptive choosability of planar graphs.

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01.

Every planar graph without cycles of length 4 to 12 is acyclically 3-choosable.

H. Hocquard and M. Montassier.

Manuscript, June 2009. Research Report RR-xxxx-09.

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. To appear in Discrete Mathematics, 2009.

[9] Acyclic choosability of planar graphs : a Steinberg like approach.

Hervé Hocquard and M. Montassier. An extended abstract in EuroComb'09, European conference on Combinatorics, Graph Theory and Applications. Bordeaux September 7-11, 2009.

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. To appear in Journal of Combinatorial Theory, Series B, 2008.

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. To appear in Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009. (here)

Manuscript, March 2009. Research Report RR-xxxx-09.

Manuscript, March 2009. Research Report RR-1458-09.

Manuscript, March 2009. Research Report RR-xxxx-09.

Manuscript, March 2009. Research Report RR-1453-09.

Manuscript, March 2009. Research Report RR-xxxx-09.

Manuscript, March 2009. Research Report RR-1455-09.

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.

O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.

Manuscript, March 2009. Research Report RR-xxxx-09.

Edge-partitions of sparse graphs and their applications to game coloring.

M. Montassier, A. Pêcher, A. Raspaud, and X. Zhu.

Manuscript, March 2009. Research Report RR-xxxx-09.

Some structural properties of planar graphs and their applications to 3-choosability.

M. Chen, M. Montassier, and A. Raspaud.

Manuscript, March 2009. Research Report RR-xxxx-09.

M. Montassier. In Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge, 2006.

M. Montassier. Trends in Mathematics: Graph Theory in Paris, 299-310, 2007. (here)

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. (invited speaker.)

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan.

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01. (invited speaker.)

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01.

[18] On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. To appear in Discrete Mathematics, 2009.

On the 3-colorability of planar graphs without 7- and 9-cycles.

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang.

Manuscript, July 2008.

## Publications

[17] Adapted list colouring of planar graphs.

L. Esperet, M. Montassier, and X. Zhu. To appear in Journal of Graph Theory, 2008.

[16] Star coloring of sparse graphs.

Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang. To appear in Journal of Graph Theory, 2008.

[15] Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.

O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud. To appear in Journal of Combinatorial Theory, Series B, 2008.

[14] An upper bound on the adaptable choosability of graphs.

M. Montassier, A. Raspaud, and X. Zhu. In European Journal of Combinatorics, 30(2):351-355, 2009. (here)

[13] A relaxation of Havel's 3-Color Problem.

M. Montassier, A. Raspaud, W. Wang and Y. Wang. In Information Processing Letters, 107(3-4):107-109, 2008. (here)

[12] Strong oriented chromatic number of planar graphs without short cycles.

M. Montassier, P. Ochem and A. Pinlou. In DMTCS, 10(1):1-24, 2008.
(here)

[11] Linear choosability of graphs.

L. Esperet, M. Montassier and A. Raspaud. In Discrete Mathematics, 308(17):3938-3950, 2008.
(here)

[10] A small non-Z4-colorable planar graph.

M. Montassier. In Discrete Mathematics, 307(13):1684-1686, 2007.
(here)

[9] Acyclic 5-choosability of planar graphs without small cycles.

M. Montassier, A. Raspaud and W. Wang. In Journal of Graph Theory, 54:245-260, 2007.
(here)

[8] Bordeaux 3-color Conjecture and 3-choosability.

M. Montassier, A. Raspaud and W. Wang. In Discrete Mathematics, 306(6):573-579, 2006.
(here)

[7] Acyclic 4-choosability of planar graphs without cycles of specific length.

M. Montassier, A. Raspaud and W. Wang. In Algorithms and Combinatorics, 26:473-491, 2006.

[6] A note on the not 3-choosability of some families of planar graphs.

M. Montassier. In Information Processing Letters, 99(2):68-71, 2006.
(here)

[5] A note on 2-facial coloring of plane graphs.

M. Montassier and A. Raspaud. In Information Processing Letters, 98(6):235-241, 2006.
(here)

[4] Acyclic 4-choosability of planar graphs with girth at least 5.

M. Montassier. In Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge, 2006.

[3] On the acyclic choosability of graphs.

M. Montassier, P. Ochem and A. Raspaud. In Journal of Graph Theory, 51(4):281-300, 2006.
(here)

[2] (d,1)-total labeling of graphs with given maximum average degree.

M. Montassier and A. Raspaud. In Journal of Graph Theory, 51(2):93-109, 2006.
(here)

[1] (d,1)-total labeling of planar graphs with large girth and high maximum degree.

F. Bazzaro, M. Montassier and A. Raspaud. In Discrete Mathematics, 307(16):2141-2151, 2007.
(here)

## Conferences

[8] Strong oriented chromatic number of planar graphs without cycles of specific lengths.

M. Montassier, P. Ochem and A. Pinlou. LAGOS '07: Latin-American Algorithms, Graphs and Optimization Symposium. Puerto Varas, Chile, November 25-29, 2007.
(here)

[7] Acyclic choosability of graphs.

M. Montassier. A survey in CS06, Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, July 10-15, 2006.

[6] Linear choosability of graphs.

L. Esperet, M. Montassier and A. Raspaud. An extended abstract in EuroComb'05, European conference on Combinatorics, Graph Theory and Applications. Berlin, September 5-9, 2005. DMTCS proc. AE, 2005, p.99-104.

[5] Acyclic choosability of graphs with small maximum degree.

D. Gonçalves and M. Montassier. 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, p.239-248, Springer-Verlag.

[4] Assignation de fréquences et étiquetage (d,1)-total dans les topologies planaires.

F. Bazzaro, M. Montassier and A. Raspaud. In 6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2004, p.27-31, Batz-sur-mer, France, 26-28 Mai 2004. Institut National de Recherche en Informatique et Automatique.

[3] On the acyclic choosability of graphs.

M. Montassier, P. Ochem and A. Raspaud. In GT'O4 Graph Theory 2004: a conference in memory of Claude Berge. Paris, July 5-9, 2004.

[2] Observability of recursive clique-trees.

M. Montassier. In Eurocomb'03. European conference on Combinatorics, Graph Theory and Applications. Prague, September 8-12, 2003.

[1] Réseaux de télécommunication minimaux embarqués tolérants aux pannes.

J-C.Bermond, O. Delmas, F. Havet, M. Montassier and S. Pérennes. In 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications ALGOTEL 2003, p.27-32, Banyuls-sur-mer, France, 12-14 mai 2003. Institut National de Recherche en Informatique et Automatique. ISBN 2-7261-1246-3.

## Manuscripts

Acyclic coloring of graph with maximum degree five.

H. Hocquard and M. Montassier.

Manuscript, November 2008. Research Report RR-1450-08.

On the 3-colorability of planar graphs without 7- and 9-cycles.

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang.

Manuscript, July 2008.

Planar graphs without adjacent cycles of length at most seven are 3-colorable.

O.V. Borodin, M. Montassier, and A. Raspaud.

Manuscript, June 2008. Research Report RR-1446-08.

Y. Bu, M. Montassier, A. Raspaud, and W. Wang.

Manuscript, January 2008.

Design of fault tolerant on-board network.

O. Delmas, F. Havet, M. Montassier and S. Pérennes.

Research Report RR-1345-05

Revised version, December 2007.

(d,1)-total labelling of sparse graphs.

L. Esperet, M. Montassier and A. Raspaud.

Research Report RR-1391-06, March 2006.

Revised version, January 2008.

A smaller not 3-choosable planar graph without 4- and 5-cycles.

M. Montassier.

Research Report RR-1361-05, July 2005.

Coloration acyclique par liste et Méthodes probabilistes.

M. Montassier and O. Serra.

6èmes Journées "Graphes et Algorithmes" Laboratoire Leibniz - Grenoble - Septembre 2004. Publié dans Les Cahiers du laboratoire Leibniz 114 (ISSN 1298-020X).

## Workshops & Seminars

The 3-Color Problem.

2009 Workshop on Graph Theory, January 10-14, 2009, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. (invited speaker.)

The 3-Color Problem

University of Ilmenau, Ilmenau, Germany. 2008/10/29.

A relaxation of Havel's Problem

Normal Zhejiang University, Jinhua, China. 2008/05/06.

Adaptive choosability of planar graphs.

Seminar Colorings '08, Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan. 2008/26/01. (invited speaker.)

Coloration orientée forte de graphes.

JGA'07, Institut Henri Poincaré, Paris. 2007/11/08.

Acyclic choosability of graphs.

Shangaï University, Shangaï, China. 2007/09/12.

(Strong) Oriented colorings of graphs.

Normal Zhejiang University, Jinhua, China. 2007/09/04.

On 3-choosability of graphs.

COMBSTRU, Charles University, Prague, Czech Republic. 2006/03/10.

l-facial coloring and l-facial choosability of graphs.

Comenius University, Bratislava, Slovak Republic. 2005/06/20.

About acyclic choosability of graphs.

COMBSTRU, Mathematical Institute, Oxford, England. 2005/04/11.

Acyclic choosability of graphs with given maximum average degree.

Comenius University, Bratislava, Slovak Republic. 2004/11/06.

Colorations acycliques par liste et méthodes probabilistes.

JGA'04, Laboratoire Leibniz, Grenoble, France. 2004/09/29.

Coloration (d,1)-totale des graphes de degré maximum donné.

Séminaire MASCOTTE, INRIA, Sophia-Antipolis, France. 2004/02/17.

Observabilité des arbres récursifs de cliques.

JGA'03, LE2I, Dijon, France. 2003/04/3.