Site.Research History

Hide minor edits - Show changes to markup

June 01, 2017, at 11:28 AM by 193.49.104.233 -
Changed line 278 from:

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

to:

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

June 01, 2017, at 11:27 AM by 193.49.104.233 -
Added lines 277-281:

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

January 10, 2017, at 11:33 AM by 193.49.104.233 -
Changed line 18 from:

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

to:

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

January 03, 2017, at 10:51 AM by 193.49.104.233 -
Added lines 8-10:

[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

Deleted lines 280-284:

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

October 30, 2016, at 07:27 AM by 193.49.104.233 -
Added lines 250-252:

[7] Vertex-partitions of graphs.
2016 International Conference on Graph Theory, Combinatorics, and Applications, October 29-31, 2016. Zhejiang Normal University, Jinhua, China. (here)

September 07, 2016, at 05:26 PM by 193.49.104.233 -
Added lines 181-183:

[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.

June 15, 2016, at 01:48 PM by 193.49.104.233 -
Added lines 268-272:

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

May 18, 2016, at 12:48 PM by 193.49.104.233 -
Deleted lines 271-274:

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

May 18, 2016, at 12:46 PM by 193.49.104.233 -
Added lines 8-9:

[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

January 28, 2016, at 11:55 AM by 193.49.104.233 -
Changed line 10 from:

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

to:

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

January 11, 2016, at 10:36 AM by 193.49.104.233 -
Changed lines 267-269 from:
to:

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

November 05, 2015, at 03:00 PM by 193.49.104.233 -
Changed line 28 from:

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

to:

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

November 05, 2015, at 03:00 PM by 193.49.104.233 -
Changed line 25 from:

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

to:

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

November 05, 2015, at 02:59 PM by 193.49.104.233 -
Changed line 16 from:

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

to:

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

November 05, 2015, at 02:53 PM by 193.49.104.233 -
Changed line 22 from:

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

to:

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

November 05, 2015, at 02:51 PM by 193.49.104.233 -
Changed line 25 from:

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

to:

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

November 05, 2015, at 02:48 PM by 193.49.104.233 -
Changed lines 30-31 from:

[39] On strong edge-colouring of graphs.
H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.

to:

[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

November 05, 2015, at 08:28 AM by 193.49.104.233 -
Changed line 37 from:

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

to:

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

October 01, 2015, at 07:19 AM by 193.49.104.233 -
Changed line 180 from:

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

to:

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

October 01, 2015, at 07:18 AM by 193.49.104.233 -
Added lines 179-181:

[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.

September 30, 2015, at 08:36 AM by 193.49.104.233 -
Added lines 9-11:

[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.

Deleted lines 263-266:

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.

June 25, 2015, at 08:56 AM by 193.49.104.233 -
Added lines 261-266:

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.

Deleted lines 269-272:

Unavoidable 3-paths in planar graphs of given girth.
S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.
Manuscript, March 2015.

June 25, 2015, at 08:53 AM by 193.49.104.233 -
Added lines 8-11:

[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.

Deleted lines 268-270:

3-paths in graphs with bounded maximum average degree.
S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.
Manuscript, February 2015.

April 10, 2015, at 11:09 AM by 193.49.104.233 -
Added lines 256-259:

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

April 07, 2015, at 04:45 PM by 193.49.104.233 -
Changed line 12 from:

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

to:

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

April 07, 2015, at 04:38 PM by 193.49.104.233 -
Changed line 27 from:

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

to:

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

April 07, 2015, at 04:34 PM by 193.49.104.233 -
Changed line 21 from:

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

to:

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

March 06, 2015, at 10:20 AM by 193.49.104.233 -
Added lines 257-259:

Unavoidable 3-paths in planar graphs of given girth.
S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.
Manuscript, March 2015.

February 24, 2015, at 01:36 PM by 193.49.104.233 -
Added lines 302-304:

Entropy compression method applied to graph colorings.
Séminaire Graphes et Structures Discrètes, ENS de Lyon, 2014/05/13.

February 23, 2015, at 02:12 PM by 193.49.104.233 -
Changed lines 9-10 from:

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

to:

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

Changed lines 12-13 from:

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

to:

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

Changed lines 15-16 from:

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

to:

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

Changed lines 18-19 from:

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

to:

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

Changed line 51 from:

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

to:

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

Changed line 107 from:

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

to:

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

Changed line 119 from:

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

to:

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

Changed line 123 from:

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

to:

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

Changed line 127 from:

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

to:

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

Changed line 135 from:

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

to:

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

Changed line 139 from:

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

to:

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

Changed line 143 from:

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

to:

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

Changed line 159 from:

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

to:

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

Changed lines 167-168 from:

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

to:

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

Changed lines 174-175 from:

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

to:

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

Changed lines 177-178 from:

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.

to:

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.

Changed lines 180-181 from:

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

to:

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

Changed lines 183-184 from:

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

to:

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

Changed lines 189-190 from:

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

to:

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

Changed lines 195-196 from:

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.

to:

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.

Changed lines 198-199 from:

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.

to:

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.

Changed line 208 from:

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

to:

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

Changed line 215 from:

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.

to:

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.

Changed lines 222-223 from:

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)

to:

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)

Changed lines 225-226 from:

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)

to:

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)

Changed lines 231-232 from:

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)

to:

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)

Changed line 263 from:

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

to:

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

Changed line 268 from:

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

to:

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

Changed line 275 from:

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

to:

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

Changed line 287 from:

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

to:

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

February 11, 2015, at 10:46 AM by 193.49.104.233 -
Deleted lines 269-275:

Near-colorings: non-colorable graphs and NP-completness.
M. Montassier, P. Ochem.
Manuscript, May 2013. http://arxiv.org/abs/1306.0752

February 11, 2015, at 09:59 AM by 193.49.104.233 -
Added lines 8-10:

[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

Added line 256:
February 04, 2015, at 09:04 AM by 193.49.104.233 -
Added lines 254-257:

3-paths in graphs with bounded maximum average degree.
S. Jendrol', M. Macekova, M. Montassier, and R. Sotak.
Manuscript, February 2015.

Changed line 265 from:

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

to:

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

September 14, 2014, at 02:57 PM by 193.49.104.233 -
Added lines 8-10:

[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.

Added line 229:
Added line 232:
Deleted lines 262-265:

Design of fault tolerant on-board network.
O. Delmas, F. Havet, M. Montassier and S. Pérennes.
Revised version, June 2014.

September 09, 2014, at 05:42 PM by 193.49.104.233 -
Changed lines 228-230 from:
to:

[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)

Changed line 232 from:

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

to:

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

September 05, 2014, at 11:42 AM by 193.49.104.233 -
Changed line 53 from:

(here)

to:

(DM)(arXiv)

September 05, 2014, at 11:40 AM by 193.49.104.233 -
Changed line 46 from:

(here)

to:

(SIAM-DM)(arXiv)

September 05, 2014, at 08:57 AM by 193.49.104.233 -
Changed line 27 from:

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

to:

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

September 05, 2014, at 08:55 AM by 193.49.104.233 -
Changed line 263 from:

Manuscript, May 2013.

to:

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

September 05, 2014, at 08:53 AM by 193.49.104.233 -
Changed lines 30-31 from:

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

to:

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

September 05, 2014, at 08:49 AM by 193.49.104.233 -
Changed line 248 from:

Manuscript, September 2014.

to:

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

September 04, 2014, at 09:53 AM by 193.49.104.233 -
Added lines 245-249:

Large induced forests in planar graphs with girth 4 or 5.
F. Dross, M. Montassier and A. Pinlou.
Manuscript, September 2014.

August 23, 2014, at 11:30 AM by 193.49.104.233 -
Added lines 8-10:

[42] Independent domination in cubic graphs.
P. Dorbec, M.A. Henning, M. Montassier, J. Southey. To appear in Journal of Graph Theory, 2014.

Deleted lines 253-256:

Independent domination in cubic graphs.
P. Dorbec, M.A. Henning, M. Montassier, J. Southey.
Manuscript, June 2013.

July 22, 2014, at 05:10 PM by 193.49.104.233 -
Changed line 357 from:

On some coloring problems of Graphs.\\

to:

On some coloring problems of graphs.\\

July 03, 2014, at 10:52 AM by 193.49.104.233 -
Added lines 162-164:

[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

June 18, 2014, at 08:07 AM by 193.49.104.233 -
Changed lines 242-243 from:

Manuscript, June 2014.

to:

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

June 17, 2014, at 06:06 PM by 193.49.104.233 -
Added lines 239-246:

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.

May 13, 2014, at 02:17 PM by 193.49.104.233 -
Added lines 162-164:

[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.

September 09, 2013, at 08:39 PM by 193.49.104.233 -
Changed line 164 from:

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

to:

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

September 09, 2013, at 08:38 PM by 193.49.104.233 -
Added lines 162-164:

[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.

September 09, 2013, at 08:36 PM by 193.49.104.233 -
Added lines 8-10:

[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.

Deleted lines 241-243:

Strong chromatic index of planar graphs with large girth.
G. Chang, M. Montassier, A. Pêcher, A. Raspaud.
Manuscript, April 2013.

July 10, 2013, at 10:00 PM by 193.49.104.233 -
Changed line 9 from:

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

to:

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

July 10, 2013, at 09:59 PM by 193.49.104.233 -
Added lines 8-10:

[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.

Deleted lines 242-244:

Generalized Power Domination in Regular Graphs.
P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud.
Manuscript, September 2012.

June 05, 2013, at 03:33 PM by 193.49.104.234 -
Added lines 227-234:

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.

April 06, 2013, at 08:38 PM by 82.233.68.8 -
Added lines 227-230:

Strong chromatic index of planar graphs with large girth.
G. Chang, M. Montassier, A. Pêcher, A. Raspaud.
Manuscript, April 2013.

March 22, 2013, at 12:28 PM by 194.254.112.231 -
Added line 25:

(here)

March 22, 2013, at 12:27 PM by 194.254.112.231 -
Changed line 27 from:

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

to:

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

March 22, 2013, at 12:24 PM by 194.254.112.231 -
Changed lines 31-32 from:
to:

(here)

Added line 36:
March 22, 2013, at 12:23 PM by 194.254.112.231 -
Changed line 34 from:
to:

(here)

March 22, 2013, at 12:21 PM by 194.254.112.231 -
Changed line 36 from:

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

to:

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

March 22, 2013, at 12:20 PM by 194.254.112.231 -
Changed lines 40-41 from:
to:

(here)

March 22, 2013, at 12:18 PM by 194.254.112.231 -
Added line 43:

(here)

March 22, 2013, at 12:17 PM by 194.254.112.231 -
Changed line 45 from:

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

to:

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

March 22, 2013, at 12:15 PM by 194.254.112.231 -
Added line 49:

(here)

March 18, 2013, at 02:17 PM by 162.38.23.88 -
Changed line 27 from:

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

to:

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

February 10, 2013, at 03:53 PM by 194.254.112.138 -
Added lines 257-259:

Méthode de compression et colorations de graphes.
Séminaire Graphes et Applications, LaBRI, Bordeaux. 2013/02/10.

January 31, 2013, at 06:05 PM by 194.254.112.147 -
Changed lines 9-10 from:

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

to:

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

Changed lines 12-13 from:

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

to:

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

Changed lines 15-16 from:

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

to:

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

January 31, 2013, at 06:04 PM by 194.254.112.147 -
Changed lines 9-10 from:

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

to:

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

Changed lines 11-12 from:

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

to:

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

Changed lines 13-14 from:

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

to:

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

January 14, 2013, at 09:54 AM by 194.254.112.147 -
January 14, 2013, at 09:54 AM by 194.254.112.147 -
Changed line 21 from:

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

to:

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

January 14, 2013, at 09:52 AM by 194.254.112.147 -
Changed line 24 from:

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

to:

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

January 14, 2013, at 09:45 AM by 194.254.112.147 -
Changed line 27 from:

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

to:

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

January 14, 2013, at 09:41 AM by 194.254.112.147 -
Changed line 30 from:

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

to:

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

January 14, 2013, at 09:36 AM by 194.254.112.147 -
Changed line 33 from:

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

to:

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

January 07, 2013, at 08:42 AM by 82.233.68.8 -
Added lines 8-10:

[39] On strong edge-colouring of graphs.
H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. To appear in Discrete Applied Mathematics, 2013.

Deleted lines 224-230:

On strong edge-colouring of graphs.
H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov.
Manuscript, April 2012.

November 27, 2012, at 06:15 PM by 194.254.112.183 -
Added lines 8-10:

[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.

Deleted lines 226-228:

Limits of near-coloring of sparse graphs.
P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud.
Manuscript, March 2012.

November 23, 2012, at 06:29 PM by 82.233.68.8 -
Added lines 8-10:

[37] Vertex-partitions of graphs into cographs and stars.
P. Dorbec, M. Montassier, and P. Ochem. To appear in Journal of Graph Theory, 2012.

Added lines 145-147:

[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.

Changed lines 228-230 from:

Vertex-partitions of graphs into cographs and stars.
P. Dorbec, M. Montassier, and P. Ochem.
Manuscript, July 2011.

to:
November 01, 2012, at 01:23 PM by 78.250.218.104 -
Added lines 191-193:

[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)

October 04, 2012, at 03:28 PM by 194.254.112.141 -
Deleted lines 217-220:

Steinberg's Conjecture and near-colorings.
G.J. Chang, F. Havet, M. Montassier, and A. Raspaud.
Manuscript, July 2011.

September 14, 2012, at 08:31 AM by 194.254.112.178 -
Changed line 208 from:

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

to:

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

Changed line 212 from:

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

to:

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

September 14, 2012, at 08:26 AM by 194.254.112.178 -
Changed lines 190-191 from:

Conferences, invited talks

to:

Conferences, invited talks

Changed line 228 from:

Research Report

to:

Research Reports

September 14, 2012, at 08:25 AM by 194.254.112.178 -
Added lines 207-210:

Generalized Power Domination in Regular Graphs.
P. Dorbec, M.A. Henning, C. Lowenstein, M. Montassier, and A. Raspaud. Manuscript, September 2012.

Added lines 227-229:

Research Report

Added lines 233-236:

Steinberg's Conjecture and near-colorings.
G.J. Chang, F. Havet, M. Montassier, and A. Raspaud.
Research Report RR-7669, INRIA, 7 2011.

June 13, 2012, at 08:07 PM by 82.233.68.8 -
Changed line 9 from:

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

to:

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

June 13, 2012, at 08:06 PM by 82.233.68.8 -
Added lines 8-10:

[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.

Deleted lines 221-224:

Locally identifying coloring of graphs.
L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau.
Manuscript, October 2010.

April 30, 2012, at 08:44 AM by 147.210.129.104 -
Added lines 8-10:

[35] L(p,q)-labeling of sparse graphs.
C. Charpentier, M. Montassier, and A. Raspaud. To appear in Journal of Combinatorial Optimization, 2012.

Deleted lines 218-223:

L(p,q)-labeling of sparse graphs.
C. Charpentier, M. Montassier, and A. Raspaud.
Manuscript, June 2011.

April 13, 2012, at 07:36 PM by 37.8.167.202 -
Added lines 200-203:

On strong edge-colouring of graphs.
H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov. Manuscript, April 2012.

March 28, 2012, at 10:07 PM by 41.66.138.177 -
Added lines 200-203:

Limits of near-coloring of sparse graphs.
P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud.
Manuscript, March 2012.

March 05, 2012, at 11:29 AM by 147.210.128.68 -
Changed line 9 from:

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

to:

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

March 05, 2012, at 11:29 AM by 147.210.128.68 -
Added lines 8-10:

[34] Generalized power domination of graphs.
G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud. To appear Discrete Applied Mathematics, 2012.

Changed lines 213-215 from:

Generalized power domination of graphs.
G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud.
Manuscript, November 2010.

to:
March 01, 2012, at 04:58 PM by 37.8.188.246 -
Changed line 33 from:

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

to:

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

February 07, 2012, at 04:24 PM by 147.210.94.20 -
Changed lines 18-19 from:

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

to:

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

Changed line 21 from:

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

to:

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

Changed line 24 from:

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

to:

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

February 07, 2012, at 04:23 PM by 147.210.94.20 -
Changed line 21 from:

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

to:

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

February 07, 2012, at 04:22 PM by 147.210.94.20 -
Changed line 30 from:
 O.V. Borodin, A.O. Ivanova,  M. Montassier, and A. Raspaud. To appear in Discrete Mathematics.
to:
 O.V. Borodin, A.O. Ivanova,  M. Montassier, and A. Raspaud. In Discrete Mathematics, 312(6):1128-1135, 2012.
February 07, 2012, at 04:18 PM by 147.210.94.20 -
Changed line 18 from:

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

to:

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

February 07, 2012, at 04:18 PM by 147.210.94.20 -
Changed line 18 from:

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

to:

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

January 19, 2012, at 08:41 AM by 147.210.128.68 -
Added lines 8-10:

[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.

Deleted lines 208-211:

A complexity dichotomy for the coloring of sparse graphs.
L. Esperet, M. Montassier, P. Ochem, and A. Pinlou.
Manuscript, January 2011.

December 06, 2011, at 11:14 AM by 147.210.128.68 -
Changed line 24 from:

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

to:

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

November 21, 2011, at 03:08 PM by 147.210.128.68 -
Changed line 181 from:

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

to:

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

November 21, 2011, at 03:07 PM by 147.210.128.68 -
Added lines 179-181:

[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)

November 03, 2011, at 05:07 PM by 147.210.128.68 -
Added lines 8-10:

[32] Adjacent vertex-distinguishing edge coloring of graphs.
H. Hocquard and M. Montassier. To appear in Journal of Combinatorial Optimization, 2011.

Deleted lines 202-205:

Adjacent vertex-distinguishing edge coloring of graphs.
H. Hocquard and M. Montassier.
Manuscript, May 2011.

September 07, 2011, at 04:05 PM by 147.210.128.128 -
Changed line 8 from:

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

to:

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

September 07, 2011, at 04:04 PM by 147.210.128.128 -
Added lines 8-10:

[31 ]Covering a graph by forests and a matching.
T. Kaiser, M. Montassier, A. Raspaud. To appear in SIAM Journal on Discrete Mathematics, 2011.

Deleted lines 215-218:

Covering a graph by forests and a matching.
T. Kaiser, M. Montassier, A. Raspaud, and O. Rucky
Manuscript, July 2010.

July 04, 2011, at 04:00 PM by 147.210.128.128 -
Added lines 185-188:

Steinberg's Conjecture and near-colorings.
G.J. Chang, F. Havet, M. Montassier, and A. Raspaud.
Manuscript, July 2011.

July 01, 2011, at 08:31 AM by 147.210.128.128 -
June 28, 2011, at 10:32 AM by 147.210.128.128 -
Added lines 185-192:

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.

June 22, 2011, at 09:22 AM by 147.210.94.20 -
Deleted lines 208-211:

Some remarks on the Three Color Problem.
V.A. Aksenov, O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud.
Manuscript, January 2010.

June 21, 2011, at 11:40 AM by 147.210.128.128 -
Deleted lines 204-209:

(k,j)-coloring of sparse graphs.
O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.
Manuscript, January 2010.

June 20, 2011, at 05:16 PM by 147.210.94.20 -
Added lines 7-9:

[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.

May 17, 2011, at 02:07 PM by 194.254.112.110 -
Added lines 8-10:

[29] On two variations of identifying codes.
O. Delmas, S. Gravier, M. Montassier, and A. Parreau. To appear in Discrete Mathematics, 2011.

Changed lines 204-207 from:

On two variations of identifying codes.
O. Delmas, S. Gravier, M. Montassier, and A. Parreau.
Manuscript, March 2010.

to:
May 11, 2011, at 02:29 PM by 194.254.112.170 -
Added lines 179-182:

Adjacent vertex-distinguishing edge coloring of graphs.
H. Hocquard and M. Montassier.
Manuscript, May 2011.

May 11, 2011, at 02:28 PM by 194.254.112.170 -
Changed line 118 from:

[15] Minmax degree of graphs.\\

to:

[15] Minmax degree of planar graphs.\\

May 11, 2011, at 02:27 PM by 194.254.112.170 -
Added lines 117-119:

[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.

May 11, 2011, at 02:26 PM by 194.254.112.170 -
Added lines 117-119:

[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.

March 29, 2011, at 10:11 PM by 82.233.68.8 -
Changed line 118 from:

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

to:

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

March 29, 2011, at 10:11 PM by 82.233.68.8 -
Added lines 117-119:

[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.

March 29, 2011, at 02:30 PM by 147.210.129.153 -
Added lines 8-10:

[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.

Deleted lines 202-205:

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.

March 25, 2011, at 11:03 AM by 147.210.129.153 -
Added lines 225-227:

Vertex-partitions of graphs into cographs and stars.
Séminaire AlGCo, LIRMM, Montpellier. 2011/03/24.

March 12, 2011, at 07:43 AM by 140.112.4.181 -
Added lines 225-227:

Vertex-partitions of graphs into cographs and stars.
GRATEL meeting, National Taipei University, Taipei, Taiwan. 2011/03/12.

February 04, 2011, at 08:16 AM by 147.210.129.153 -
Changed line 181 from:

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

to:

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

January 11, 2011, at 03:08 PM by 147.210.94.20 -
Added lines 8-10:

[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.

Deleted lines 183-185:

Decomposing graphs into forests.
M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu.
Manuscript, March 2010.

January 05, 2011, at 08:39 PM by 82.233.68.8 -
Added lines 164-167:

A complexity dichotomy for the coloring of sparse graphs.
L. Esperet, M. Montassier, P. Ochem, and A. Pinlou.
Manuscript, January 2011.

December 10, 2010, at 08:37 AM by 194.254.112.111 -
Added lines 221-223:

Nine Dragon Tree Conjectures.
GRATOS meeting, LIRMM, Montpellier. 2010/12/09.

December 04, 2010, at 01:41 PM by 82.233.68.8 -
Changed line 12 from:

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

to:

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

December 04, 2010, at 01:41 PM by 82.233.68.8 -
Changed line 12 from:

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

to:

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

December 04, 2010, at 01:38 PM by 82.233.68.8 -
Changed line 15 from:

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

to:

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

December 04, 2010, at 01:36 PM by 82.233.68.8 -
Changed line 15 from:

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

to:

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

December 04, 2010, at 01:35 PM by 82.233.68.8 -
Added line 20:
December 04, 2010, at 01:34 PM by 82.233.68.8 -
December 04, 2010, at 01:34 PM by 82.233.68.8 -
Changed lines 18-19 from:

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

to:

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

December 04, 2010, at 01:33 PM by 82.233.68.8 -
Added line 22:

(here)

December 04, 2010, at 01:32 PM by 82.233.68.8 -
Changed lines 21-22 from:

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

to:

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

Changed lines 25-26 from:
to:

(here)

Changed line 28 from:

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

to:

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

December 04, 2010, at 01:31 PM by 82.233.68.8 -
Added line 28:

(here)

December 04, 2010, at 01:29 PM by 82.233.68.8 -
Added line 31:

(here)

December 04, 2010, at 01:28 PM by 82.233.68.8 -
Added line 34:

(here)

December 04, 2010, at 01:20 PM by 82.233.68.8 -
Added line 37:

(here)

December 04, 2010, at 01:19 PM by 82.233.68.8 -
Added line 40:

(here)

December 04, 2010, at 01:18 PM by 82.233.68.8 -
Added line 43:

(here)

December 04, 2010, at 01:17 PM by 82.233.68.8 -
Added line 46:

(here)

December 04, 2010, at 01:15 PM by 82.233.68.8 -
Added line 49:

(here)

December 04, 2010, at 01:14 PM by 82.233.68.8 -
Added line 52:

(here)

December 04, 2010, at 01:12 PM by 82.233.68.8 -
Changed line 55 from:
to:

(here)

December 04, 2010, at 01:10 PM by 82.233.68.8 -
Added line 59:

(here)

December 04, 2010, at 01:09 PM by 82.233.68.8 -
Changed lines 61-62 from:

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

to:

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

December 04, 2010, at 01:08 PM by 82.233.68.8 -
Added line 65:

(here)

December 04, 2010, at 01:06 PM by 82.233.68.8 -
Changed line 80 from:

(here)

to:

(here)

December 04, 2010, at 01:05 PM by 82.233.68.8 -
Added line 68:

(here)

December 04, 2010, at 01:01 PM by 82.233.68.8 -
Added line 71:

(here)

December 04, 2010, at 12:59 PM by 82.233.68.8 -
Added line 74:

(here)

December 04, 2010, at 12:58 PM by 82.233.68.8 -
Added line 77:

(here)

December 04, 2010, at 12:07 PM by 82.233.68.8 -
Added line 80:

(here)

December 04, 2010, at 12:06 PM by 82.233.68.8 -
Added line 83:

(here)

December 04, 2010, at 12:05 PM by 82.233.68.8 -
Changed line 85 from:

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

to:

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

November 30, 2010, at 11:40 AM by 147.210.129.153 -
Changed lines 15-16 from:

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

to:

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

Changed lines 18-19 from:

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

to:

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

Changed lines 21-22 from:

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

to:

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

Changed lines 24-25 from:

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

to:

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

Changed lines 27-28 from:

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

to:

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

Changed lines 30-31 from:

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

to:

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

Changed lines 33-34 from:

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

to:

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

Changed lines 36-37 from:

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

to:

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

Changed lines 39-40 from:

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

to:

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

Changed lines 42-43 from:

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

to:

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

Changed lines 45-46 from:

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

to:

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

Changed lines 48-49 from:

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

to:

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

Changed lines 52-53 from:

(here)

to:
Changed lines 55-56 from:

(here)

to:
Changed lines 59-60 from:

(here)

to:
Changed lines 62-63 from:

(here)

to:
Changed lines 65-66 from:

(here)

to:
Changed lines 67-68 from:

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

to:

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

Changed lines 71-72 from:

(here)

to:
Changed lines 74-75 from:

(here)

to:
Changed lines 76-77 from:

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

to:

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

Changed lines 80-81 from:

(here)

to:
Changed lines 83-84 from:

(here)

to:
Deleted line 85:

(here)

November 20, 2010, at 06:45 PM by 82.233.68.8 -
Changed line 263 from:

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

to:

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

November 20, 2010, at 06:44 PM by 82.233.68.8 -
Changed line 107 from:

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

to:

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

Changed line 154 from:

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

to:

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

November 20, 2010, at 06:42 PM by 82.233.68.8 -
Changed lines 263-264 from:

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

to:

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

November 20, 2010, at 06:42 PM by 82.233.68.8 -
Changed lines 263-267 from:

Reviewer:

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

Jury:

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

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

November 20, 2010, at 06:41 PM by 82.233.68.8 -
Changed lines 264-265 from:
F. Havet, A. Kostochka, and C. Thomassen.\\
to:
F. Havet, A. Kostochka, and C. Thomassen.
November 20, 2010, at 06:41 PM by 82.233.68.8 -
Changed lines 264-265 from:
F. Havet, A. Kostochka, and C. Thomassen
to:
F. Havet, A. Kostochka, and C. Thomassen.\\
November 20, 2010, at 06:40 PM by 82.233.68.8 -
Changed lines 264-266 from:
Indented text

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

to:
F. Havet, A. Kostochka, and C. Thomassen
Changed lines 267-268 from:
Indented text

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

to:
F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.
November 20, 2010, at 06:40 PM by 82.233.68.8 -
Changed lines 264-265 from:

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

to:
Indented text

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

Indented text

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

November 20, 2010, at 06:39 PM by 82.233.68.8 -
Changed lines 263-264 from:

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

to:

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

November 20, 2010, at 06:39 PM by 82.233.68.8 -
Changed lines 260-261 from:

Habilitation à diriger des recherches

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

to:

"Habilitation à diriger des recherches"

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

November 20, 2010, at 06:38 PM by 82.233.68.8 -
Changed lines 256-264 from:

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

to:

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


Habilitation à diriger des recherches

On some coloring problems of Graphs. November 17, 2010.
Reviewer: F. Havet, A. Kostochka, and C. Thomassen
Jury: F. Havet, A. Raspaud, E. Sopena, W. Wang, and X. Zhu.

November 20, 2010, at 06:26 PM by 82.233.68.8 -
Added lines 152-155:

Generalized power domination of graphs.
G. J. Chang, P. Dorbec, M. Montassier and A. Raspaud.
Manuscript, November 2010.

October 19, 2010, at 12:11 PM by 147.210.129.153 -
Changed line 154 from:

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

to:

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

October 19, 2010, at 11:12 AM by 147.210.129.153 -
Added lines 152-155:

Locally identifying coloring of graphs.
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, and Aline Parreau.
Manuscript, October 2010.

September 09, 2010, at 05:17 PM by 147.210.129.153 -
Changed line 24 from:

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

to:

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

September 09, 2010, at 05:14 PM by 147.210.129.153 -
Changed line 15 from:

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

to:

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

September 09, 2010, at 05:12 PM by 147.210.129.153 -
Changed line 111 from:

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)

to:

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)

September 09, 2010, at 05:11 PM by 147.210.129.153 -
Changed line 115 from:

(here)

to:

(here)

September 09, 2010, at 05:09 PM by 147.210.129.153 -
Changed line 21 from:

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

to:

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

September 09, 2010, at 05:08 PM by 147.210.129.153 -
Changed line 18 from:

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

to:

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

September 09, 2010, at 05:06 PM by 147.210.129.153 -
Changed line 27 from:

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

to:

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

September 09, 2010, at 05:06 PM by 147.210.129.153 -
Changed line 30 from:

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

to:

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

September 09, 2010, at 05:04 PM by 147.210.129.153 -
Changed line 33 from:

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

to:

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

September 09, 2010, at 05:00 PM by 147.210.129.153 -
Changed line 42 from:

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

to:

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

September 09, 2010, at 04:58 PM by 147.210.129.153 -
Changed line 45 from:

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

to:

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

September 09, 2010, at 04:57 PM by 147.210.129.153 -
Changed line 48 from:

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

to:

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

September 09, 2010, at 04:56 PM by 147.210.129.153 -
Changed line 56 from:

(here)

to:

(here)

September 09, 2010, at 04:55 PM by 147.210.129.153 -
Changed line 60 from:

(here)

to:

(here)

September 09, 2010, at 04:53 PM by 147.210.129.153 -
Changed line 68 from:

(here)

to:

(here)

September 09, 2010, at 04:50 PM by 147.210.129.153 -
Changed line 75 from:

(here)

to:

(here)

September 09, 2010, at 04:36 PM by 147.210.129.153 -
Added lines 75-78:

(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.

Deleted lines 79-82:

[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)

September 09, 2010, at 04:35 PM by 147.210.129.153 -
Changed line 75 from:

(here)

to:

(here)

September 09, 2010, at 04:33 PM by 147.210.129.153 -
Changed line 94 from:

(here)

to:

(here)

August 29, 2010, at 07:37 PM by 82.233.68.8 -
Added lines 8-10:

[26] (k,1)-coloring of sparse graphs.
O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud. To appear in Discrete Mathematics.

Deleted lines 175-178:

(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.

July 24, 2010, at 08:09 AM by 147.210.129.153 -
Added lines 8-10:

[25] Backbone coloring of graphs.
Y. Bu, M. Montassier, A. Raspaud, and W. Wang. To appear in Journal of Combinatorial Optimization.

Deleted lines 180-183:

Backbone coloring of graphs.
Y. Bu, M. Montassier, A. Raspaud, and W. Wang.
Manuscript, January 2008.

July 13, 2010, at 08:59 AM by 147.210.129.153 -
Added lines 8-10:

[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.

Deleted lines 157-160:

Decomposition of sparse graphs into two forests, one having bounded maximum degree.
M. Montassier, A. Raspaud, and X. Zhu.
Manuscript, February 2010.

July 01, 2010, at 03:08 PM by 129.175.217.148 -
Changed lines 92-93 from:

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.

to:

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.

Changed lines 95-96 from:

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.

to:

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.

Changed line 98 from:

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

to:

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

Changed line 102 from:

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)

to:

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)

July 01, 2010, at 03:05 PM by 129.175.217.148 -
Added lines 143-146:

Covering a graph by forests and a matching.
T. Kaiser, M. Montassier, and A. Raspaud.
Manuscript, July 2010.

June 01, 2010, at 07:47 AM by 147.210.129.153 -
Changed line 91 from:

[12] Decomposing a graph into forests.\\

to:

[12] Decomposing a graph into forests.\\

June 01, 2010, at 07:47 AM by 147.210.129.153 -
Added lines 90-100:

[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.

April 15, 2010, at 07:45 AM by 147.210.129.153 -
Changed line 12 from:

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

to:

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

April 15, 2010, at 07:44 AM by 147.210.129.153 -
Changed line 9 from:

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

to:

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

April 15, 2010, at 07:42 AM by 147.210.129.153 -
Changed line 9 from:

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

to:

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

March 22, 2010, at 12:50 AM by 140.117.200.235 -
Changed lines 121-122 from:

[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)

to:

[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)

March 22, 2010, at 12:49 AM by 140.117.200.235 -
Added lines 120-122:

[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)

March 18, 2010, at 11:02 AM by 140.117.246.253 -
Changed line 12 from:

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

to:

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

March 18, 2010, at 03:27 AM by 140.112.50.156 -
Added lines 186-188:

Near-coloring of sparse graphs.
Tamkang University, Taipei, Taiwan. 2010/03/16.

March 14, 2010, at 08:27 AM by 140.117.200.235 -
Added lines 137-140:

Decomposition of sparse graphs into two forests, one having bounded maximum degree.
M. Montassier, A. Raspaud, and X. Zhu.
Manuscript, February 2010.

March 12, 2010, at 01:02 AM by 140.117.200.235 -
Added lines 130-137:

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.

Changed line 139 from:
 O.V. Borodin, A.O. Ivanova,  M. Montassier, and A. Raspaud.\\
to:

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

February 08, 2010, at 09:58 AM by 82.250.80.35 -
Added lines 150-153:

Backbone coloring of graphs.
Y. Bu, M. Montassier, A. Raspaud, and W. Wang.
Manuscript, January 2008.

Deleted lines 156-161:

Backbone coloring of graphs.
Y. Bu, M. Montassier, A. Raspaud, and W. Wang.
Manuscript, January 2008.

January 29, 2010, at 08:40 AM by 147.210.129.245 -
Added lines 130-141:

(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.

Changed line 143 from:
 O. V. Borodin, A. O. Ivanova,  M. Montassier, and A. Raspaud.\\
to:
 O.V. Borodin, A.O. Ivanova,  M. Montassier, and A. Raspaud.\\
Changed lines 158-161 from:

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.

to:
January 26, 2010, at 10:11 AM by 147.210.129.245 -
Changed lines 139-140 from:

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

to:

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

January 26, 2010, at 10:11 AM by 147.210.129.245 -
Added lines 137-139:

Acyclic coloring of graphs with maximum degree five.
H. Hocquard and M. Montassier. Research report RR-1450-08. Revised version, 2010.

January 08, 2010, at 05:51 PM by 82.65.19.151 -
Changed line 174 from:

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 |

to:

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

January 08, 2010, at 05:50 PM by 82.65.19.151 -
Changed line 174 from:

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|

to:

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 |

January 08, 2010, at 05:48 PM by 82.65.19.151 -
Changed lines 122-123 from:

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/

to:

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

Changed line 125 from:

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/

to:

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

January 08, 2010, at 05:47 PM by 82.65.19.151 -
Changed lines 111-112 from:

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.

to:

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)

Changed lines 114-115 from:

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

to:

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

Changed line 117 from:

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.

to:

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)

January 08, 2010, at 05:41 PM by 82.65.19.151 -
Changed line 108 from:

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.

to:

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)

January 08, 2010, at 05:40 PM by 82.65.19.151 -
Changed line 98 from:

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

to:

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

January 08, 2010, at 05:37 PM by 82.65.19.151 -
Changed lines 102-103 from:
to:

(here)

Changed line 105 from:

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.

to:

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)

January 08, 2010, at 05:30 PM by 82.65.19.151 -
Changed lines 164-165 from:

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

to:

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

Changed lines 167-168 from:

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

to:

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

Changed lines 170-171 from:

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

to:

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

Changed lines 173-174 from:

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

to:

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|

Changed lines 179-180 from:

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

to:

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

Changed lines 200-201 from:

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

to:

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

Changed line 203 from:

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

to:

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

January 08, 2010, at 05:21 PM by 82.65.19.151 -
Changed line 167 from:

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

to:

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

January 08, 2010, at 05:19 PM by 82.65.19.151 -
Changed line 164 from:

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

to:

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

January 08, 2010, at 05:18 PM by 82.65.19.151 -
Changed line 62 from:

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

to:

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

January 08, 2010, at 05:00 PM by 82.255.113.112 -
Changed lines 121-122 from:

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

to:

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/

Changed line 124 from:

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

to:

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/

January 05, 2010, at 08:46 AM by 147.210.129.245 -
Changed line 18 from:

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

to:

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

December 22, 2009, at 12:29 PM by 82.251.119.204 -
Deleted lines 132-137:

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.

Deleted lines 135-136:
December 22, 2009, at 09:39 AM by 82.251.11.246 -
Changed lines 9-10 from:

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

to:

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

Changed lines 12-13 from:

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

to:

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

Changed lines 15-16 from:

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

to:

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

Changed lines 18-19 from:

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

to:

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

Changed lines 21-22 from:

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

to:

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

Changed lines 24-25 from:

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

to:

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

Changed lines 27-28 from:

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

to:

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

Changed lines 30-31 from:

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

to:

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

Changed lines 33-34 from:

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

to:

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

Changed lines 36-37 from:

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

to:

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

Changed lines 39-40 from:

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

to:

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

Changed lines 43-44 from:

(here)

to:

(here)

Changed lines 47-48 from:

(here)

to:

(here)

Changed lines 51-52 from:

(here)

to:

(here)

Changed lines 55-56 from:

(here)

to:

(here)

Changed lines 59-60 from:

(here)

to:

(here)

Changed lines 62-63 from:

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

to:

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

Changed lines 66-67 from:

(here)

to:

(here)

Changed lines 70-71 from:

(here)

to:

(here)

Changed lines 73-74 from:

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

to:

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

Changed lines 77-78 from:

(here)

to:

(here)

Changed line 81 from:

(here)\\

to:

(here)

December 22, 2009, at 09:38 AM by 82.251.11.246 -
Added line 10:
Added line 13:
Added line 16:
Added line 19:
Added line 22:
Added line 25:
Added line 28:
Added line 31:
Added line 34:
Added line 37:
Added line 40:
Added line 44:
Added line 48:
Added line 52:
Added line 56:
Added line 60:
Added line 63:
Added line 67:
Added line 71:
Added line 74:
Added line 78:
Added line 82:
December 22, 2009, at 09:37 AM by 82.251.11.246 -
Changed lines 11-12 from:

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

to:

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

Changed lines 13-14 from:

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

to:

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

Changed lines 15-16 from:

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

to:

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

Changed lines 17-18 from:

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

to:

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

Changed lines 19-20 from:

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

to:

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

Changed lines 21-22 from:

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

to:

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

Changed lines 23-24 from:

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

to:

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

Changed lines 25-26 from:

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

to:

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

Changed lines 27-28 from:

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

to:

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

Changed lines 29-30 from:

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

to:

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

Changed lines 32-33 from:

(here)

to:

(here)\\

Changed lines 35-36 from:

(here)

to:

(here)\\

Changed lines 38-39 from:

(here)

to:

(here)\\

Changed lines 41-42 from:

(here)

to:

(here)\\

Changed lines 44-45 from:

(here)

to:

(here)\\

Changed lines 46-47 from:

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

to:

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

Changed lines 49-50 from:

(here)

to:

(here)\\

Changed lines 52-53 from:

(here)

to:

(here)\\

Changed lines 54-55 from:

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

to:

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

Changed lines 57-58 from:

(here)

to:

(here)\\

Changed lines 60-61 from:

(here)

to:

(here)\\

December 22, 2009, at 09:34 AM by 82.251.11.246 -
Changed line 9 from:

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

to:

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

December 22, 2009, at 09:33 AM by 82.251.11.246 -
Deleted line 9:
December 22, 2009, at 09:33 AM by 82.251.11.246 -
Changed line 9 from:

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

to:

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

December 22, 2009, at 09:33 AM by 82.251.11.246 -
Changed lines 8-11 from:

[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.

to:

[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.

December 22, 2009, at 09:32 AM by 82.251.11.246 -
Changed line 8 from:

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

to:

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

December 22, 2009, at 09:29 AM by 82.251.11.246 -
December 22, 2009, at 09:29 AM by 82.251.11.246 -
December 22, 2009, at 09:26 AM by 82.251.11.246 -
Added lines 7-11:

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.

December 21, 2009, at 09:33 AM by 147.210.129.245 -
Added lines 8-10:

[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.

Changed lines 134-136 from:

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.

to:
November 27, 2009, at 06:39 PM by 93.167.196.211 -
Changed line 167 from:

Near coloring of sparse graphs.\\

to:

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

November 27, 2009, at 06:38 PM by 93.167.196.211 -
Added lines 167-169:

Near coloring of sparse graphs.
Graph Theory 2009 , Fredericia, Denmark. 2009/11/27.

Changed line 173 from:

Near coloring of sparse graphs\\

to:

Near coloring of sparse graphs.\\

Changed line 176 from:

The 3-Color Problem\\

to:

The 3-Color Problem.\\

Changed line 179 from:

A relaxation of Havel's Problem\\

to:

A relaxation of Havel's Problem.\\

November 20, 2009, at 04:18 PM by 147.210.129.245 -
Changed lines 139-141 from:

Acyclic coloring of graph with maximum degree five.
H. Hocquard and M. Montassier.
Manuscript, November 2008. Research Report RR-1450-08.

to:
November 16, 2009, at 11:53 AM by 147.210.129.245 -
Added lines 168-170:

Decomposition of sparse graphs, application to game coloring number.
LIRMM, Montpellier, France. 2009/11/12.

November 16, 2009, at 11:52 AM by 147.210.129.245 -
October 23, 2009, at 09:15 AM by 147.210.129.245 -
Changed line 125 from:

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

to:

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

October 23, 2009, at 08:23 AM by 147.210.129.245 -
Changed line 15 from:

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

to:

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

October 23, 2009, at 08:23 AM by 147.210.129.245 -
Changed line 24 from:

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

to:

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

October 23, 2009, at 08:19 AM by 147.210.129.245 -
Changed line 15 from:

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

to:

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

October 23, 2009, at 08:15 AM by 147.210.129.245 -
Added lines 123-130:

(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.

Changed line 132 from:

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

to:

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

October 21, 2009, at 10:50 AM by 147.210.94.126 -
Changed line 124 from:

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

to:

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

October 19, 2009, at 03:51 PM by 147.210.129.245 -
Added lines 160-162:

Near coloring of sparse graphs
LIRMM, Montpellier, France. 2009/10/16.

September 18, 2009, at 08:18 AM by 147.210.128.239 -
Changed line 9 from:

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

to:

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

August 28, 2009, at 10:57 AM by 82.251.124.130 -
Changed line 85 from:

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

to:

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)

August 28, 2009, at 10:55 AM by 82.251.124.130 -
Changed line 21 from:

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

to:

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

August 21, 2009, at 08:56 AM by 82.248.88.254 -
Added lines 8-10:

[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.

Deleted lines 121-126:

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.

August 17, 2009, at 09:45 AM by 82.65.47.71 -
Added lines 3-4:
August 17, 2009, at 09:45 AM by 82.65.47.71 -
Added lines 3-4:

International journals

August 14, 2009, at 06:12 PM by 82.252.22.71 -
Changed line 5 from:

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

to:

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

August 14, 2009, at 06:12 PM by 82.252.22.71 -
Added lines 4-6:

[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..

Deleted lines 132-135:

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.

August 12, 2009, at 04:56 PM by 82.254.10.73 -
Added lines 4-6:

[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.

Changed lines 17-18 from:

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)

to:

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

Changed lines 113-115 from:

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.

to:
July 16, 2009, at 01:07 PM by 82.254.254.198 -
Changed line 112 from:

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

to:

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

July 03, 2009, at 08:48 PM by 82.255.142.204 -
Changed line 99 from:

Conferences (invited)

to:

Conferences, invited talks

July 03, 2009, at 08:45 PM by 82.255.142.204 -
Changed line 99 from:

Conferences invité

to:

Conferences (invited)

July 03, 2009, at 08:44 PM by 82.255.142.204 -
Deleted line 97:
Added lines 99-106:

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.


Deleted lines 159-161:

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

Deleted lines 164-166:

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

July 03, 2009, at 03:50 PM by 147.210.128.239 -
Added lines 102-105:

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.

June 23, 2009, at 04:58 PM by 147.210.94.126 -
Changed line 5 from:

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

to:

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

June 22, 2009, at 07:44 PM by 82.64.144.254 -
Added lines 71-72:

[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.

May 06, 2009, at 11:01 AM by 147.210.128.239 -
Changed line 14 from:

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

to:

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)

April 21, 2009, at 03:52 PM by 82.255.155.159 -
Changed line 103 from:

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

to:

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

April 16, 2009, at 08:09 PM by 82.253.231.109 -
Changed line 107 from:

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

to:

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

April 16, 2009, at 08:03 PM by 82.253.231.109 -
Changed line 111 from:

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

to:

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

March 25, 2009, at 05:43 PM by 147.210.128.239 -
Added lines 100-111:

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.

March 13, 2009, at 09:47 AM by 147.210.94.126 -
Changed line 54 from:

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

to:

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

March 08, 2009, at 02:02 PM by 82.254.245.96 -
Changed lines 136-137 from:

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

to:

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

Changed line 145 from:

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

to:

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

March 08, 2009, at 01:45 PM by 82.254.245.96 -
Added lines 4-6:

[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.

Deleted lines 103-106:

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.

February 25, 2009, at 12:11 PM by 82.251.132.142 -
Deleted line 0:

February 25, 2009, at 12:05 PM by 82.251.132.142 -
Added line 1:

Deleted line 2:
Deleted line 13:
Deleted line 39:
Deleted line 67:
Deleted line 69:
Deleted line 95:
Deleted line 96:
Deleted line 98:
Deleted lines 119-121:
Deleted line 133:
Deleted line 134:
February 25, 2009, at 12:03 PM by 82.251.132.142 -
Added line 68:

Added lines 99-100:

Added lines 142-143:

February 25, 2009, at 12:00 PM by 82.251.132.142 -
Added lines 1-184:

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.

Backbone coloring of graphs.
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.


LIRMM

HAL-LIRMM

Dept. Info UM2

GT Graphes

Vertex-partitions of planar graphs

The 3-Color Problem

Around the world