Подписаться
André Raspaud
André Raspaud
Professor emeritus, LaBRI, Bordeaux University, France
Подтвержден адрес электронной почты в домене labri.fr - Главная страница
Название
Процитировано
Процитировано
Год
Good and semi-strong colorings of oriented planar graphs
A Raspaud, E Sopena
Information Processing Letters 51 (4), 171-174, 1994
2041994
Star coloring of graphs
G Fertin, A Raspaud, B Reed
Journal of graph theory 47 (3), 163-182, 2004
1872004
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
1812005
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
1421999
Recursive graphs with small-world scale-free properties
F Comellas, G Fertin, A Raspaud
physical review E 69 (3), 037104, 2004
1352004
Acyclic colouring of 1-planar graphs
OV Borodin, AV Kostochka, A Raspaud, E Sopena
Discrete Applied Mathematics 114 (1-3), 29-41, 2001
1112001
Colorings and girth of oriented planar graphs
J Nešetřil, A Raspaud, É Sopena
Discrete Mathematics 165, 519-530, 1997
1071997
Fulkerson′ s Conjecture and Circuit Covers
GH Fan, A Raspaud
Journal of Combinatorial Theory, Series B 61 (1), 133-138, 1994
1041994
Acyclic and k-distance coloring of the grid
G Fertin, E Godard, A Raspaud
Information Processing Letters 87 (1), 51-58, 2003
1012003
The chromatic number of a signed graph
E Máčajová, A Raspaud, M Škoviera
arXiv preprint arXiv:1412.6349, 2014
1002014
On the vertex-arboricity of planar graphs
A Raspaud, W Wang
European Journal of Combinatorics 29 (4), 1064-1075, 2008
892008
Colored homomorphisms of colored mixed graphs
J Nešetřil, A Raspaud
Journal of Combinatorial Theory, Series B 80 (1), 147-155, 2000
832000
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
802002
Generalized power domination of graphs
GJ Chang, P Dorbec, M Montassier, A Raspaud
Discrete applied mathematics 160 (12), 1691-1698, 2012
782012
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
A survey on Knödel graphs
G Fertin, A Raspaud
Discrete Applied Mathematics 137 (2), 173-195, 2004
762004
On star coloring of graphs
G Fertin, A Raspaud, B Reed
Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001
712001
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
632009
Two edge-disjoint Hamiltonian cycles in the butterfly graph
D Barth, A Raspaud
Information processing letters 51 (4), 175-179, 1994
631994
Injective coloring of planar graphs
Y Bu, D Chen, A Raspaud, W Wang
Discrete Applied Mathematics 157 (4), 663-672, 2009
602009
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20