André Raspaud

Min Chen, André Raspaud: Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Discrete Applied Mathematics 161(7-8): 921-931 (2013)

Clément Charpentier, Mickaël Montassier, André Raspaud: L(p, q)-labeling of sparse graphs. J. Comb. Optim. 25(4): 646-660 (2013)

Min Chen, André Raspaud, Weifan Wang: 6-Star-Coloring of Subcubic Graphs. Journal of Graph Theory 72(2): 128-145 (2013)

André Raspaud, Li-Da Tong: The minimum identifying code graphs. Discrete Applied Mathematics 160(9): 1385-1389 (2012)

Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud: On the size of identifying codes in triangle-free graphs. Discrete Applied Mathematics 160(10-11): 1532-1546 (2012)

Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud: Generalized power domination of graphs. Discrete Applied Mathematics 160(12): 1691-1698 (2012)

Min Chen, Mickaël Montassier, André Raspaud: Some structural properties of planar graphs and their applications to 3-choosability. Discrete Mathematics 312(2): 362-373 (2012)

Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud: (k, 1)-coloring of sparse graphs. Discrete Mathematics 312(6): 1128-1135 (2012)

Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao: Upper k-tuple domination in graphs. Discrete Mathematics & Theoretical Computer Science 14(2): 285-292 (2012)

Jaroslav Nesetril, André Raspaud: Preface. Eur. J. Comb. 33(5): 685-687 (2012)

Min Chen, André Raspaud, Weifan Wang: Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33(5): 905-923 (2012)

Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud: On backbone coloring of graphs. J. Comb. Optim. 23(1): 79-93 (2012)

Min Chen, Gena Hahn, André Raspaud, Weifan Wang: Some results on the injective chromatic number of graphs. J. Comb. Optim. 24(3): 299-318 (2012)

Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu: Decomposing a graph into forests. J. Comb. Theory, Ser. B 102(1): 38-52 (2012)

Min Chen, André Raspaud: A sufficient condition for planar graphs to be acyclically 5-choosable. Journal of Graph Theory 70(2): 135-151 (2012)

Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud: (k, j)-coloring of sparse graphs. Discrete Applied Mathematics 159(17): 1947-1953 (2011)

Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu: Acyclic 4-choosability of planar graphs. Discrete Mathematics 311(1): 92-101 (2011)

Chao Li, Weifan Wang, André Raspaud: Upper bounds on the linear chromatic number of a graph. Discrete Mathematics 311(4): 232-238 (2011)

Min Chen, André Raspaud, Weifan Wang: 8-star-choosability of a graph with maximum average degree less than 3. Discrete Mathematics & Theoretical Computer Science 13(3): 97-110 (2011)

Clément Charpentier, Mickaël Montassier, André Raspaud: Minmax degree of graphs (Extended abstract). Electronic Notes in Discrete Mathematics 38: 251-257 (2011)

Gary MacGillivray, André Raspaud, Jacobus Swarts: Obstructions to Injective Oriented Colourings. Electronic Notes in Discrete Mathematics 38: 597-605 (2011)

André Raspaud, Xuding Zhu: Circular flow on signed graphs. J. Comb. Theory, Ser. B 101(6): 464-479 (2011)

Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu: Short cycle covers of graphs and nowhere-zero flows. Journal of Graph Theory 68(4): 340-348 (2011)

Tomás Kaiser, Mickaël Montassier, André Raspaud: Covering a Graph by Forests and a Matching. SIAM J. Discrete Math. 25(4): 1804-1811 (2011)

Hervé Hocquard, Mickaël Montassier, André Raspaud: A note on the acyclic 3-choosability of some planar graphs. Discrete Applied Mathematics 158(10): 1104-1110 (2010)

Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena: Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics 158(12): 1365-1379 (2010)

Oleg V. Borodin, Mickaël Montassier, André Raspaud: Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discrete Mathematics 310(1): 167-173 (2010)

Alain Doyon, Gena Hahn, André Raspaud: Some bounds on the injective chromatic number of graphs. Discrete Mathematics 310(3): 585-590 (2010)

Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu: Decomposition of sparse graphs, with application to game coloring number. Discrete Mathematics 310(10-11): 1520-1523 (2010)

Min Chen, André Raspaud: On acyclic 4-choosability of planar graphs without short cycles. Discrete Mathematics 310(15-16): 2113-2118 (2010)

Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud: Acyclic 3-choosability of sparse graphs with girth at least 7. Discrete Mathematics 310(17-18): 2426-2434 (2010)

Oleg V. Borodin, Alexei N. Glebov, André Raspaud: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Discrete Mathematics 310(20): 2584-2594 (2010)

Min Chen, André Raspaud: Homomorphisms from sparse graphs to the Petersen graph. Discrete Mathematics 310(20): 2705-2713 (2010)

Oleg V. Borodin, Anna O. Ivanova, André Raspaud: Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Discrete Mathematics 310(21): 2946-2950 (2010)

Tomás Kaiser, André Raspaud: Perfect matchings with restricted intersection in cubic graphs. Eur. J. Comb. 31(5): 1307-1315 (2010)

Mickaël Montassier, André Raspaud, Xuding Zhu: Decomposition of sparse graphs into two forests, one having bounded maximum degree. Inf. Process. Lett. 110(20): 913-916 (2010)

Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. Journal of Graph Theory 65(2): 83-93 (2010)

Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud: On the size of identifying codes in triangle-free graphs. CoRR abs/1010.5975 (2010)

Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang: Injective coloring of planar graphs. Discrete Applied Mathematics 157(4): 663-672 (2009)

Olivier Delmas, André Raspaud: Preface. Discrete Mathematics 309(11): 3463-3464 (2009)

André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics 309(11): 3541-3552 (2009)

Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud: On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discrete Mathematics 309(13): 4596-4607 (2009)

André Raspaud, Weifan Wang: Linear coloring of planar graphs with large girth. Discrete Mathematics 309(18): 5678-5686 (2009)

Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera: Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30(1): 53-69 (2009)

Mickaël Montassier, André Raspaud, Xuding Zhu: An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30(2): 351-355 (2009)

Jaroslav Nesetril, André Raspaud: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). Electronic Notes in Discrete Mathematics 34: 1-8 (2009)

Amanda Montejano, Alexandre Pinlou, André Raspaud, Eric Sopena: Chromatic number of sparse colored mixed planar graphs. Electronic Notes in Discrete Mathematics 34: 363-367 (2009)

Jiaojiao Wu, André Raspaud: Game chromatic number of toroidal grids. Electronic Notes in Discrete Mathematics 34: 381-385 (2009)

Min Chen, André Raspaud: Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Electronic Notes in Discrete Mathematics 34: 659-667 (2009)

André Raspaud, Jiaojiao Wu: Game chromatic number of toroidal grids. Inf. Process. Lett. 109(21-22): 1183-1186 (2009)

Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. J. Comb. Theory, Ser. B 99(4): 668-673 (2009)

Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang: Star coloring of sparse graphs. Journal of Graph Theory 62(3): 201-219 (2009)

Gary MacGillivray, André Raspaud, Jacobus Swarts: Injective Oriented Colourings. WG 2009: 262-272

Louis Esperet, Mickaël Montassier, André Raspaud: Linear choosability of graphs. Discrete Mathematics 308(17): 3938-3950 (2008)

André Raspaud, Weifan Wang: On the vertex-arboricity of planar graphs. Eur. J. Comb. 29(4): 1064-1075 (2008)

Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena: Homomorphisms of 2-edge-colored graphs. Electronic Notes in Discrete Mathematics 30: 33-38 (2008)

Guillaume Fertin, André Raspaud: Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. 105(2): 65-72 (2008)

Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang: A relaxation of Havel's 3-color problem. Inf. Process. Lett. 107(3-4): 107-109 (2008)

Pavol Hell, André Raspaud, Juraj Stacho: On Injective Colourings of Chordal Graphs. LATIN 2008: 520-530

Guillaume Fertin, André Raspaud: L(p, q) labeling of d-dimensional grids. Discrete Mathematics 307(16): 2132-2140 (2007)

Fabrice Bazzaro, Mickaël Montassier, André Raspaud: (d, 1)-total labelling of planar graphs with large girth and high maximum degree. Discrete Mathematics 307(16): 2141-2151 (2007)

Tomás Kaiser, André Raspaud: Non-intersecting perfect matchings in cubic graphs (Extended abstract). Electronic Notes in Discrete Mathematics 28: 293-299 (2007)

André Raspaud, Nicolas Roussel: Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract. Electronic Notes in Discrete Mathematics 28: 507-514 (2007)

Min Chen, André Raspaud, Weifan Wang: Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101(3): 134-138 (2007)

Mickaël Montassier, André Raspaud, Weifan Wang: Acyclic 5-choosability of planar graphs without small cycles. Journal of Graph Theory 54(3): 245-260 (2007)

André Raspaud, Xuding Zhu: List circular coloring of trees and cycles. Journal of Graph Theory 55(3): 249-265 (2007)

Daniel Gonçcalves, André Raspaud, M. A. Shalu: On Oriented Labelling Parameters. Formal Models, Languages and Applications 2007: 34-45

Mickaël Montassier, André Raspaud, Weifan Wang: Bordeaux 3-color conjecture and 3-choosability. Discrete Mathematics 306(6): 573-579 (2006)

Mickaël Montassier, André Raspaud: A note on 2-facial coloring of plane graphs. Inf. Process. Lett. 98(6): 235-241 (2006)

Mickaël Montassier, André Raspaud: (d, 1)-total labeling of graphs with a given maximum average degree. Journal of Graph Theory 51(2): 93-109 (2006)

Mickaël Montassier, Pascal Ochem, André Raspaud: On the acyclic choosability of graphs. Journal of Graph Theory 51(4): 281-300 (2006)

Edita Mácajová, André Raspaud: On the strong circular 5-flow conjecture. Journal of Graph Theory 52(4): 307-316 (2006)

Edita Mácajová, André Raspaud, Martin Skoviera: Abelian Colourings of Cubic Graphs. Electronic Notes in Discrete Mathematics 22: 333-339 (2005)

Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory, Ser. B 93(2): 303-311 (2005)

Guillaume Fertin, André Raspaud: A survey on Knödel graphs. Discrete Applied Mathematics 137(2): 173-195 (2004)

Matt DeVos, Jaroslav Nesetril, André Raspaud: Antisymmetric flows and edge-connectivity. Discrete Mathematics 276(1-3): 161-167 (2004)

Guillaume Fertin, André Raspaud, Bruce A. Reed: Star coloring of graphs. Journal of Graph Theory 47(3): 163-182 (2004)

Guillaume Fertin, André Raspaud, Ondrej Sýkora: No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO 2004: 138-148

Guillaume Fertin, André Raspaud, Arup Roychowdhury: On the oriented chromatic number of grids. Inf. Process. Lett. 85(5): 261-266 (2003)

Guillaume Fertin, Emmanuel Godard, André Raspaud: Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87(1): 51-58 (2003)

Oleg V. Borodin, André Raspaud: A sufficient condition for planar graphs to be 3-colorable. J. Comb. Theory, Ser. B 88(1): 17-27 (2003)

Francesc Comellas, Guillaume Fertin, André Raspaud: Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. SIROCCO 2003: 73-87

Guillaume Fertin, Emmanuel Godard, André Raspaud: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3): 131-139 (2002)

Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory, Ser. B 86(1): 100-108 (2002)

Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena: Acyclic list 7-coloring of planar graphs. Journal of Graph Theory 40(2): 83-90 (2002)

Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Eric Sopena: Acyclic colouring of 1-planar graphs. Discrete Applied Mathematics 114(1-3): 29-41 (2001)

Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On nice graphs. Discrete Mathematics 234(1-3): 39-51 (2001)

Denise Amar, André Raspaud, Olivier Togni: All-to-all wavelength-routing in all-optical compound networks. Discrete Mathematics 235(1-3): 353-363 (2001)

Guillaume Fertin, André Raspaud: Neighborhood Communications in Networks. Electronic Notes in Discrete Mathematics 10: 103-108 (2001)

Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On Deeply Critical Oriented Graphs. J. Comb. Theory, Ser. B 81(1): 150-155 (2001)

Guillaume Fertin, André Raspaud: k-Neighborhood Broadcasting. SIROCCO 2001: 133-146

Guillaume Fertin, André Raspaud, Bruce A. Reed: On Star Coloring of Graphs. WG 2001: 140-153

Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena: Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216

Guillaume Fertin, André Raspaud: Recognizing Recursive Circulant Graphs (Extended Abstract). Electronic Notes in Discrete Mathematics 5: 112-115 (2000)

Jaroslav Nesetril, André Raspaud: Colored Homomorphisms of Colored Mixed Graphs. J. Comb. Theory, Ser. B 80(1): 147-155 (2000)

André Raspaud, Ondrej Sýkora, Imrich Vrto: Congestion and dilation, similarities and differences: A survey. SIROCCO 2000: 269-280

Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Diameter of the Knödel Graph. WG 2000: 149-160

Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: On the maximum average degree and the oriented chromatic number of a graph. Discrete Mathematics 206(1-3): 77-89 (1999)

Cyril Gavoille, Jean-Claude Bermond, André Raspaud (Eds.): SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999. Carleton Scientific 1999

Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: On universal graphs for planar oriented graphs of a given girth. Discrete Mathematics 188(1-3): 73-85 (1998)

Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud: Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. IEEE Trans. Parallel Distrib. Syst. 9(8): 788-802 (1998)

Guillaume Fertin, André Raspaud: Families of Graphs Having Broadcasting and Gossiping Properties. WG 1998: 63-77

Ginette Gauyacq, C. Micheneau, André Raspaud: Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. WG 1998: 227-241

Roger Labahn, André Raspaud: Periodic Gossiping in Back-to-back Trees. Discrete Applied Mathematics 75(2): 157-168 (1997)

Jarik Nesetril, André Raspaud, Eric Sopena: Colorings and girth of oriented planar graphs. Discrete Mathematics 165-166: 519-530 (1997)

Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud: Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738

Oscar Ordaz, Denise Amar, André Raspaud: Hamiltonian properties and the bipartite independence number. Discrete Mathematics 161(1-3): 207-215 (1996)

Dominique Barth, Johny Bond, André Raspaud: Compatible Eulerian Circuits in K_n**. Discrete Applied Mathematics 56(2-3): 127-136 (1995)

Dominique Barth, François Pellegrini, André Raspaud, Jean Roman: On Bandwidth, Cutwidth, and Quotient Graphs. ITA 29(6): 487-508 (1995)

André Raspaud, Ondrej Sýkora, Imrich Vrto: Cutwidth of the Bruijn Graph. ITA 29(6): 509-514 (1995)

André Raspaud, Eric Sopena: Good and Semi-Strong Colorings of Oriented Planar Graphs. Inf. Process. Lett. 51(4): 171-174 (1994)

Dominique Barth, André Raspaud: Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. Inf. Process. Lett. 51(4): 175-179 (1994)

Genghua Fan, André Raspaud: Fulkerson's Conjecture and Circuit Covers. J. Comb. Theory, Ser. B 61(1): 133-138 (1994)

André Raspaud: Postman tours and cycle covers. Discrete Mathematics 111(1-3): 447-454 (1993)

Denise Amar, André Raspaud: Covering the vertices of a digraph by cycles of prescribed length. Discrete Mathematics 87(2): 111-118 (1991)

André Raspaud: Cycle covers of graphs with a nowhere-zero 4-flow. Journal of Graph Theory 15(6): 649-654 (1991)

Ury Jamshy, André Raspaud, Michael Tarsi: Short circuit covers for regular matroids with a nowhere zero 5-flow. J. Comb. Theory, Ser. B 43(3): 354-357 (1987)