dblp.uni-trier.dewww.uni-trier.de

André Raspaud Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
64EEYuehua Bu, Dong Chen, André Raspaud, Weifan Wang: Injective coloring of planar graphs. Discrete Applied Mathematics 157(4): 663-672 (2009)
63EEDaniel 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)
62EEMickaël Montassier, André Raspaud, Xuding Zhu: An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30(2): 351-355 (2009)
2008
61EEPavol Hell, André Raspaud, Juraj Stacho: On Injective Colourings of Chordal Graphs. LATIN 2008: 520-530
60EELouis Esperet, Mickaël Montassier, André Raspaud: Linear choosability of graphs. Discrete Mathematics 308(17): 3938-3950 (2008)
59EEAmanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena: Homomorphisms of 2-edge-colored graphs. Electronic Notes in Discrete Mathematics 30: 33-38 (2008)
58EEAndré Raspaud, Weifan Wang: On the vertex-arboricity of planar graphs. Eur. J. Comb. 29(4): 1064-1075 (2008)
57EEGuillaume Fertin, André Raspaud: Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. 105(2): 65-72 (2008)
56EEMickaë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)
2007
55EEGuillaume Fertin, André Raspaud: L(p, q) labeling of d-dimensional grids. Discrete Mathematics 307(16): 2132-2140 (2007)
54EEFabrice 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)
53EETomás Kaiser, André Raspaud: Non-intersecting perfect matchings in cubic graphs (Extended abstract). Electronic Notes in Discrete Mathematics 28: 293-299 (2007)
52EEAndré 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)
51EEMin Chen, André Raspaud, Weifan Wang: Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101(3): 134-138 (2007)
50EEMickaël Montassier, André Raspaud, Weifan Wang: Acyclic 5-choosability of planar graphs without small cycles. Journal of Graph Theory 54(3): 245-260 (2007)
49EEAndré Raspaud, Xuding Zhu: List circular coloring of trees and cycles. Journal of Graph Theory 55(3): 249-265 (2007)
2006
48EEMickaël Montassier, André Raspaud, Weifan Wang: Bordeaux 3-color conjecture and 3-choosability. Discrete Mathematics 306(6): 573-579 (2006)
47EEMickaël Montassier, André Raspaud: A note on 2-facial coloring of plane graphs. Inf. Process. Lett. 98(6): 235-241 (2006)
46EEMickaë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)
45EEMickaël Montassier, Pascal Ochem, André Raspaud: On the acyclic choosability of graphs. Journal of Graph Theory 51(4): 281-300 (2006)
44EEEdita Mácajová, André Raspaud: On the strong circular 5-flow conjecture. Journal of Graph Theory 52(4): 307-316 (2006)
2005
43EEEdita Mácajová, André Raspaud, Martin Skoviera: Abelian Colourings of Cubic Graphs. Electronic Notes in Discrete Mathematics 22: 333-339 (2005)
42EEOleg 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)
2004
41EEGuillaume Fertin, André Raspaud, Ondrej Sýkora: No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO 2004: 138-148
40EEGuillaume Fertin, André Raspaud: A survey on Knödel graphs. Discrete Applied Mathematics 137(2): 173-195 (2004)
39EEMatt DeVos, Jaroslav Nesetril, André Raspaud: Antisymmetric flows and edge-connectivity. Discrete Mathematics 276(1-3): 161-167 (2004)
38EEGuillaume Fertin, André Raspaud, Bruce A. Reed: Star coloring of graphs. Journal of Graph Theory 47(3): 163-182 (2004)
2003
37 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
36EEGuillaume Fertin, André Raspaud, Arup Roychowdhury: On the oriented chromatic number of grids. Inf. Process. Lett. 85(5): 261-266 (2003)
35EEGuillaume Fertin, Emmanuel Godard, André Raspaud: Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87(1): 51-58 (2003)
34EEOleg V. Borodin, André Raspaud: A sufficient condition for planar graphs to be 3-colorable. J. Comb. Theory, Ser. B 88(1): 17-27 (2003)
2002
33EEGuillaume Fertin, Emmanuel Godard, André Raspaud: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3): 131-139 (2002)
32EEDmitry 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)
2001
31 Guillaume Fertin, André Raspaud: k-Neighborhood Broadcasting. SIROCCO 2001: 133-146
30EEGuillaume Fertin, André Raspaud, Bruce A. Reed: On Star Coloring of Graphs. WG 2001: 140-153
29EECyril Gavoille, David Peleg, André Raspaud, Eric Sopena: Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216
28 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)
27EEPavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On nice graphs. Discrete Mathematics 234(1-3): 39-51 (2001)
26EEDenise Amar, André Raspaud, Olivier Togni: All-to-all wavelength-routing in all-optical compound networks. Discrete Mathematics 235(1-3): 353-363 (2001)
25EEGuillaume Fertin, André Raspaud: Neighborhood Communications in Networks. Electronic Notes in Discrete Mathematics 10: 103-108 (2001)
24EEOleg 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)
2000
23 André Raspaud, Ondrej Sýkora, Imrich Vrto: Congestion and dilation, similarities and differences: A survey. SIROCCO 2000: 269-280
22EEGuillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Diameter of the Knödel Graph. WG 2000: 149-160
21EEGuillaume Fertin, André Raspaud: Recognizing Recursive Circulant Graphs (Extended Abstract). Electronic Notes in Discrete Mathematics 5: 112-115 (2000)
20EEJaroslav Nesetril, André Raspaud: Colored Homomorphisms of Colored Mixed Graphs. J. Comb. Theory, Ser. B 80(1): 147-155 (2000)
1999
19 Cyril Gavoille, Jean-Claude Bermond, André Raspaud: SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999 Carleton Scientific 1999
18EEOleg 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)
1998
17EEGinette Gauyacq, C. Micheneau, André Raspaud: Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. WG 1998: 227-241
16EEGuillaume Fertin, André Raspaud: Families of Graphs Having Broadcasting and Gossiping Properties. WG 1998: 63-77
15EEOleg 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)
14EEJohanne 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)
1997
13EEJohanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud: Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738
12EERoger Labahn, André Raspaud: Periodic Gossiping in Back-to-back Trees. Discrete Applied Mathematics 75(2): 157-168 (1997)
11EEJarik Nesetril, André Raspaud, Eric Sopena: Colorings and girth of oriented planar graphs. Discrete Mathematics 165-166: 519-530 (1997)
1996
10EEOscar Ordaz, Denise Amar, André Raspaud: Hamiltonian properties and the bipartite independence number. Discrete Mathematics 161(1-3): 207-215 (1996)
1995
9EEDominique Barth, Johny Bond, André Raspaud: Compatible Eulerian Circuits in Kn**. Discrete Applied Mathematics 56(2-3): 127-136 (1995)
8 Dominique Barth, François Pellegrini, André Raspaud, Jean Roman: On Bandwidth, Cutwidth, and Quotient Graphs. ITA 29(6): 487-508 (1995)
7 André Raspaud, Ondrej Sýkora, Imrich Vrto: Cutwidth of the Bruijn Graph. ITA 29(6): 509-514 (1995)
1994
6 André Raspaud, Eric Sopena: Good and Semi-Strong Colorings of Oriented Planar Graphs. Inf. Process. Lett. 51(4): 171-174 (1994)
5 Dominique Barth, André Raspaud: Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. Inf. Process. Lett. 51(4): 175-179 (1994)
4EEGenghua Fan, André Raspaud: Fulkerson's Conjecture and Circuit Covers. J. Comb. Theory, Ser. B 61(1): 133-138 (1994)
1993
3EEAndré Raspaud: Postman tours and cycle covers. Discrete Mathematics 111(1-3): 447-454 (1993)
1991
2EEDenise Amar, André Raspaud: Covering the vertices of a digraph by cycles of prescribed length. Discrete Mathematics 87(2): 111-118 (1991)
1987
1EEUry 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)

Coauthor Index

1Denise Amar [2] [10] [26]
2Dominique Barth [5] [8] [9]
3Fabrice Bazzaro [54]
4Jean-Claude Bermond [19]
5Johny Bond [9]
6Oleg V. Borodin [15] [18] [24] [28] [34] [42]
7Yuehua Bu [64]
8Dong Chen [64]
9Min Chen [51]
10Johanne Cohen [13] [14]
11Francesc Comellas [37]
12Matt DeVos [39]
13Louis Esperet [60]
14Genghua Fan [4]
15Guillaume Fertin [16] [21] [22] [25] [30] [31] [33] [35] [36] [37] [38] [40] [41] [55] [57]
16Dmitry Fon-Der-Flaass [24] [32]
17Pierre Fraigniaud [13] [14]
18Ginette Gauyacq [17]
19Cyril Gavoille [19] [29]
20Alexei N. Glebov [42]
21Emmanuel Godard [33] [35]
22Pavol Hell [27] [61]
23Ury Jamshy [1]
24Tomás Kaiser [53]
25Jean-Claude König [13] [14]
26Alexandr V. Kostochka [15] [18] [24] [27] [28] [32]
27Daniel Král [63]
28Roger Labahn [12]
29Edita Mácajová [43] [44] [63]
30C. Micheneau [17]
31Mickaël Montassier [45] [46] [47] [48] [50] [54] [56] [60] [62]
32Amanda Montejano [59]
33Jaroslav Nesetril (Jarik Nesetril) [11] [15] [18] [20] [32] [39]
34Pascal Ochem [45] [59]
35Oscar Ordaz [10]
36Ondrej Pangrác [63]
37David Peleg [29]
38François Pellegrini [8]
39Alexandre Pinlou [59]
40Bruce A. Reed [30] [38]
41Jean Roman [8]
42Nicolas Roussel [52]
43Arup Roychowdhury [36]
44Mohammad R. Salavatipour [42]
45Heiko Schröder [22]
46Jean-Sébastien Sereni [63]
47Martin Skoviera [43] [63]
48Eric Sopena [6] [11] [15] [18] [24] [27] [28] [29] [32] [59]
49Juraj Stacho [61]
50Ondrej Sýkora [7] [22] [23] [41]
51Michael Tarsi [1]
52Olivier Togni [26]
53Imrich Vrto [7] [22] [23]
54Weifan Wang [48] [50] [51] [56] [58] [64]
55Yingqian Wang [56]
56Xuding Zhu [49] [62]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)