André Raspaud
André Raspaud
Professor emeritus, LaBRI, Bordeaux University, France
Verified email at labri.fr - Homepage
Title
Cited by
Cited by
Year
Good and semi-strong colorings of oriented planar graphs
A Raspaud, E Sopena
Information Processing Letters 51 (4), 171-174, 1994
1751994
Good and semi-strong colorings of oriented planar graphs
A Raspaud, E Sopena
Information Processing Letters 51 (4), 171-174, 1994
1721994
Planar graphs without cycles of length from 4 to 7 are 3-colorable
OV Borodin, AN Glebov, A Raspaud, MR Salavatipour
Journal of Combinatorial Theory, Series B 93 (2), 303-311, 2005
1502005
Star coloring of graphs
G Fertin, A Raspaud, B Reed
Journal of graph theory 47 (3), 163-182, 2004
1432004
Star coloring of graphs
G Fertin, A Raspaud, B Reed
Journal of graph theory 47 (3), 163-182, 2004
1432004
On the maximum average degree and the oriented chromatic number of a graph
OV Borodin, AV Kostochka, J Nesetril, A Raspaud, E Sopena
Discrete Mathematics 206 (1-3), 77-90, 1999
1281999
On the maximum average degree and the oriented chromatic number of a graph
OV Borodin, AV Kostochka, J Nesetril, A Raspaud, E Sopena
Discrete Mathematics 206 (1-3), 77-90, 1999
1281999
Recursive graphs with small-world scale-free properties
F Comellas, G Fertin, A Raspaud
physical review E 69 (3), 037104, 2004
1272004
Colorings and girth of oriented planar graphs
J Nešetřil, A Raspaud, E Sopena
Discrete Mathematics 165, 519-530, 1997
981997
Acyclic colouring of 1-planar graphs
OV Borodin, AV Kostochka, A Raspaud, E Sopena
Discrete Applied Mathematics 114 (1-3), 29-41, 2001
962001
Acyclic and k-distance coloring of the grid
G Fertin, E Godard, A Raspaud
Information Processing Letters 87 (1), 51-58, 2003
872003
Acyclic colouring of 1-planar graphs
OV Borodin, AV Kostochka, A Raspaud, E Sopena
Discrete Applied Mathematics 114 (1-3), 29-41, 2001
782001
Acyclic list 7‐coloring of planar graphs
OV Borodin, DG Fon‐Der Flaass, AV Kostochka, A Raspaud, É Sopena
Journal of Graph Theory 40 (2), 83-90, 2002
742002
Fulkerson′ s Conjecture and Circuit Covers
GH Fan, A Raspaud
Journal of Combinatorial Theory, Series B 61 (1), 133-138, 1994
741994
A sufficient condition for planar graphs to be 3-colorable
OV Borodin, A Raspaud
Journal of Combinatorial Theory, Series B 88 (1), 17-27, 2003
702003
On the vertex-arboricity of planar graphs
A Raspaud, W Wang
European Journal of Combinatorics 29 (4), 1064-1075, 2008
652008
On star coloring of graphs
G Fertin, A Raspaud, B Reed
International Workshop on Graph-Theoretic Concepts in Computer Science, 140-153, 2001
652001
Colored homomorphisms of colored mixed graphs
J Nešetřil, A Raspaud
Journal of Combinatorial Theory, Series B 80 (1), 147-155, 2000
612000
Antibandwidth and cyclic antibandwidth of meshes and hypercubes
A Raspaud, H Schröder, O Sýkora, L Torok, I Vrt’o
Discrete Mathematics 309 (11), 3541-3552, 2009
542009
A survey on Knödel graphs
G Fertin, A Raspaud
Discrete Applied Mathematics 137 (2), 173-195, 2004
542004
The system can't perform the operation now. Try again later.
Articles 1–20