Spremljaj
André Raspaud
André Raspaud
Professor emeritus, LaBRI, Bordeaux University, France
Preverjeni e-poštni naslov na labri.fr - Domača stran
Naslov
Navedeno
Navedeno
Leto
Good and semi-strong colorings of oriented planar graphs
A Raspaud, E Sopena
Information Processing Letters 51 (4), 171-174, 1994
1911994
Good and semi-strong colorings of oriented planar graphs
A Raspaud, E Sopena
Information Processing Letters 51 (4), 171-174, 1994
1881994
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
1712005
Star coloring of graphs
G Fertin, A Raspaud, B Reed
Journal of graph theory 47 (3), 163-182, 2004
1702004
Star coloring of graphs
G Fertin, A Raspaud, B Reed
Journal of graph theory 47 (3), 163-182, 2004
1702004
On the maximum average degree and the oriented chromatic number of a graph
OV Borodin, AV Kostochka, J Nešetřil, A Raspaud, É Sopena
Discrete Mathematics 206 (1-3), 77-89, 1999
1351999
On the maximum average degree and the oriented chromatic number of a graph
OV Borodin, AV Kostochka, J Nešetřil, A Raspaud, É Sopena
Discrete Mathematics 206 (1-3), 77-89, 1999
1351999
Recursive graphs with small-world scale-free properties
F Comellas, G Fertin, A Raspaud
physical review E 69 (3), 037104, 2004
1332004
Colorings and girth of oriented planar graphs
J Nešetřil, A Raspaud, É Sopena
Discrete Mathematics 165, 519-530, 1997
1061997
Acyclic colouring of 1-planar graphs
OV Borodin, AV Kostochka, A Raspaud, E Sopena
Discrete Applied Mathematics 114 (1-3), 29-41, 2001
1052001
Acyclic and k-distance coloring of the grid
G Fertin, E Godard, A Raspaud
Information Processing Letters 87 (1), 51-58, 2003
942003
Fulkerson′ s Conjecture and Circuit Covers
GH Fan, A Raspaud
Journal of Combinatorial Theory, Series B 61 (1), 133-138, 1994
891994
Acyclic colouring of 1-planar graphs
OV Borodin, AV Kostochka, A Raspaud, E Sopena
Discrete Applied Mathematics 114 (1-3), 29-41, 2001
862001
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
812002
On the vertex-arboricity of planar graphs
A Raspaud, W Wang
European Journal of Combinatorics 29 (4), 1064-1075, 2008
782008
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
782003
Colored homomorphisms of colored mixed graphs
J Nešetřil, A Raspaud
Journal of Combinatorial Theory, Series B 80 (1), 147-155, 2000
742000
The chromatic number of a signed graph
E Máčajová, A Raspaud, M Škoviera
arXiv preprint arXiv:1412.6349, 2014
702014
Generalized power domination of graphs
GJ Chang, P Dorbec, M Montassier, A Raspaud
Discrete applied mathematics 160 (12), 1691-1698, 2012
702012
On star coloring of graphs
G Fertin, A Raspaud, B Reed
International Workshop on Graph-Theoretic Concepts in Computer Science, 140-153, 2001
682001
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20