Skip to Main content Skip to Navigation


...
hal-01184439v1  Conference papers
Guillaume FertinAndré Raspaud. Acyclic Coloring of Graphs of Maximum Degree $\Delta$
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.389-396
lirmm-02011333v1  Journal articles
Christopher DuffyGary MacgillivrayPascal OchemAndré Raspaud. Oriented incidence colourings of digraphs
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2019, 39 (1), pp.191-210. ⟨10.7151/dmgt.2076⟩
...
hal-01184391v1  Conference papers
Louis EsperetMickaël MontassierAndré Raspaud. Linear choosability of graphs
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.99-104
hal-00442434v1  Journal articles
Guillaume FertinAndré Raspaud. A Survey on Knödel Graphs
Discrete Applied Mathematics, Elsevier, 2003, 137 (2), pp.173--195
hal-00656800v1  Journal articles
Mickaël MontassierPatrice Ossona de MendezAndré RaspaudXuding Zhu. Decomposing a graph into forests
Journal of Combinatorial Theory, Series B, Elsevier, 2012, 102 (1), pp.38-52. ⟨10.1016/j.jctb.2011.04.001⟩
hal-00411734v1  Directions of work or proceedings
Olivier DelmasAndré Raspaud. 7th International Colloquium on Graph Theory - ICGT 05
Discrete Mathematics - Volume 309, Issue 11, Pages 3463-3732 - Elsevier B.V., pp.270, 2009
...
hal-00530172v3  Journal articles
Florent FoucaudRalf KlasingAdrian KosowskiAndré Raspaud. On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics, Elsevier, 2012, 160 (10-11), pp.1532-1546. ⟨10.1016/j.dam.2012.02.009⟩