André Raspaud

Planar graphs without cycles of length from 4 to 7 are 3-colorable

O. V. Borodin, A. N. Glebov, André Raspaud et al. · Journal of Combinatorial Theory Series B · 2004 · 140 citations

Geometric Graph Theory, Graph Theory, Topological Graph Theory +5

Good and semi-strong colorings of oriented planar graphs

André Raspaud, Éric Sopena · Information Processing Letters · 1994 · 136 citations

Geometric Graph Theory, Graph Theory, Planar Graph +4

Recursive graphs with small-world scale-free properties

Francesc Comellas, Guillaume Fertin, André Raspaud · Physical Review E · 2004 · 103 citations · Full text

Engineering, Network Analysis, Education +17

On the maximum average degree and the oriented chromatic number of a graph

O.V. Borodin, Alexandr Kostochka, Jaroslav Nešetřil et al. · Discrete Mathematics · 1999 · 89 citations

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +6

Acyclic colouring of 1-planar graphs

O. V. Borodin, A.V. Kostochka, André Raspaud et al. · Discrete Applied Mathematics · 2001 · 87 citations

Geometric Graph Theory, Graph Theory, Acyclic Colouring +5