| 2009 |
|---|
| 63 | EE | 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) |
| 62 | EE | Mickaël Montassier,
André Raspaud,
Xuding Zhu:
An upper bound on adaptable choosability of graphs.
Eur. J. Comb. 30(2): 351-355 (2009) |
| 2008 |
|---|
| 61 | EE | Pavol Hell,
André Raspaud,
Juraj Stacho:
On Injective Colourings of Chordal Graphs.
LATIN 2008: 520-530 |
| 60 | EE | Louis Esperet,
Mickaël Montassier,
André Raspaud:
Linear choosability of graphs.
Discrete Mathematics 308(17): 3938-3950 (2008) |
| 59 | EE | 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) |
| 58 | EE | André Raspaud,
Weifan Wang:
On the vertex-arboricity of planar graphs.
Eur. J. Comb. 29(4): 1064-1075 (2008) |
| 57 | EE | Guillaume Fertin,
André Raspaud:
Acyclic coloring of graphs of maximum degree five: Nine colors are enough.
Inf. Process. Lett. 105(2): 65-72 (2008) |
| 56 | EE | 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) |
| 2007 |
|---|
| 55 | EE | Guillaume Fertin,
André Raspaud:
L(p, q) labeling of d-dimensional grids.
Discrete Mathematics 307(16): 2132-2140 (2007) |
| 54 | EE | 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) |
| 53 | EE | Tomás Kaiser,
André Raspaud:
Non-intersecting perfect matchings in cubic graphs (Extended abstract).
Electronic Notes in Discrete Mathematics 28: 293-299 (2007) |
| 52 | EE | 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) |
| 51 | EE | Min Chen,
André Raspaud,
Weifan Wang:
Three-coloring planar graphs without short cycles.
Inf. Process. Lett. 101(3): 134-138 (2007) |
| 50 | EE | 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) |
| 49 | EE | André Raspaud,
Xuding Zhu:
List circular coloring of trees and cycles.
Journal of Graph Theory 55(3): 249-265 (2007) |
| 2006 |
|---|
| 48 | EE | Mickaël Montassier,
André Raspaud,
Weifan Wang:
Bordeaux 3-color conjecture and 3-choosability.
Discrete Mathematics 306(6): 573-579 (2006) |
| 47 | EE | Mickaël Montassier,
André Raspaud:
A note on 2-facial coloring of plane graphs.
Inf. Process. Lett. 98(6): 235-241 (2006) |
| 46 | EE | 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) |
| 45 | EE | Mickaël Montassier,
Pascal Ochem,
André Raspaud:
On the acyclic choosability of graphs.
Journal of Graph Theory 51(4): 281-300 (2006) |
| 44 | EE | Edita Mácajová,
André Raspaud:
On the strong circular 5-flow conjecture.
Journal of Graph Theory 52(4): 307-316 (2006) |
| 2005 |
|---|
| 43 | EE | Edita Mácajová,
André Raspaud,
Martin Skoviera:
Abelian Colourings of Cubic Graphs.
Electronic Notes in Discrete Mathematics 22: 333-339 (2005) |
| 42 | EE | 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) |
| 2004 |
|---|
| 41 | EE | Guillaume Fertin,
André Raspaud,
Ondrej Sýkora:
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.
SIROCCO 2004: 138-148 |
| 40 | EE | Guillaume Fertin,
André Raspaud:
A survey on Knödel graphs.
Discrete Applied Mathematics 137(2): 173-195 (2004) |
| 39 | EE | Matt DeVos,
Jaroslav Nesetril,
André Raspaud:
Antisymmetric flows and edge-connectivity.
Discrete Mathematics 276(1-3): 161-167 (2004) |
| 38 | EE | Guillaume 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 |
| 36 | EE | Guillaume Fertin,
André Raspaud,
Arup Roychowdhury:
On the oriented chromatic number of grids.
Inf. Process. Lett. 85(5): 261-266 (2003) |
| 35 | EE | Guillaume Fertin,
Emmanuel Godard,
André Raspaud:
Acyclic and k-distance coloring of the grid.
Inf. Process. Lett. 87(1): 51-58 (2003) |
| 34 | EE | 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) |
| 2002 |
|---|
| 33 | EE | Guillaume Fertin,
Emmanuel Godard,
André Raspaud:
Minimum feedback vertex set and acyclic coloring.
Inf. Process. Lett. 84(3): 131-139 (2002) |
| 32 | EE | 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) |
| 2001 |
|---|
| 31 | | Guillaume Fertin,
André Raspaud:
k-Neighborhood Broadcasting.
SIROCCO 2001: 133-146 |
| 30 | EE | Guillaume Fertin,
André Raspaud,
Bruce A. Reed:
On Star Coloring of Graphs.
WG 2001: 140-153 |
| 29 | EE | Cyril 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) |
| 27 | EE | Pavol Hell,
Alexandr V. Kostochka,
André Raspaud,
Eric Sopena:
On nice graphs.
Discrete Mathematics 234(1-3): 39-51 (2001) |
| 26 | EE | Denise Amar,
André Raspaud,
Olivier Togni:
All-to-all wavelength-routing in all-optical compound networks.
Discrete Mathematics 235(1-3): 353-363 (2001) |
| 25 | EE | Guillaume Fertin,
André Raspaud:
Neighborhood Communications in Networks.
Electronic Notes in Discrete Mathematics 10: 103-108 (2001) |
| 24 | EE | 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) |
| 2000 |
|---|
| 23 | | André Raspaud,
Ondrej Sýkora,
Imrich Vrto:
Congestion and dilation, similarities and differences: A survey.
SIROCCO 2000: 269-280 |
| 22 | EE | Guillaume Fertin,
André Raspaud,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Diameter of the Knödel Graph.
WG 2000: 149-160 |
| 21 | EE | Guillaume Fertin,
André Raspaud:
Recognizing Recursive Circulant Graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics 5: 112-115 (2000) |
| 20 | EE | Jaroslav 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 |
| 18 | EE | 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) |
| 1998 |
|---|
| 17 | | Ginette Gauyacq,
C. Micheneau,
André Raspaud:
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition.
WG 1998: 227-241 |
| 16 | | Guillaume Fertin,
André Raspaud:
Families of Graphs Having Broadcasting and Gossiping Properties.
WG 1998: 63-77 |
| 15 | EE | 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) |
| 14 | EE | 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) |
| 1997 |
|---|
| 13 | EE | Johanne Cohen,
Pierre Fraigniaud,
Jean-Claude König,
André Raspaud:
Broadcasting and Multicasting in Cut-through Routed Networks.
IPPS 1997: 734-738 |
| 12 | EE | Roger Labahn,
André Raspaud:
Periodic Gossiping in Back-to-back Trees.
Discrete Applied Mathematics 75(2): 157-168 (1997) |
| 11 | EE | Jarik Nesetril,
André Raspaud,
Eric Sopena:
Colorings and girth of oriented planar graphs.
Discrete Mathematics 165-166: 519-530 (1997) |
| 1996 |
|---|
| 10 | EE | Oscar Ordaz,
Denise Amar,
André Raspaud:
Hamiltonian properties and the bipartite independence number.
Discrete Mathematics 161(1-3): 207-215 (1996) |
| 1995 |
|---|
| 9 | EE | Dominique 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) |
| 4 | EE | Genghua Fan,
André Raspaud:
Fulkerson's Conjecture and Circuit Covers.
J. Comb. Theory, Ser. B 61(1): 133-138 (1994) |
| 1993 |
|---|
| 3 | EE | André Raspaud:
Postman tours and cycle covers.
Discrete Mathematics 111(1-3): 447-454 (1993) |
| 1991 |
|---|
| 2 | EE | Denise Amar,
André Raspaud:
Covering the vertices of a digraph by cycles of prescribed length.
Discrete Mathematics 87(2): 111-118 (1991) |
| 1987 |
|---|
| 1 | EE | 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) |
