Good and semi-strong colorings of oriented planar graphs A Raspaud, E Sopena Information Processing Letters 51 (4), 171-174, 1994 | 201 | 1994 |

Star coloring of graphs G Fertin, A Raspaud, B Reed Journal of graph theory 47 (3), 163-182, 2004 | 182 | 2004 |

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 | 180 | 2005 |

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 | 139 | 1999 |

Recursive graphs with small-world scale-free properties F Comellas, G Fertin, A Raspaud physical review E 69 (3), 037104, 2004 | 135 | 2004 |

Acyclic colouring of 1-planar graphs OV Borodin, AV Kostochka, A Raspaud, E Sopena Discrete Applied Mathematics 114 (1-3), 29-41, 2001 | 110 | 2001 |

Colorings and girth of oriented planar graphs J Nešetřil, A Raspaud, É Sopena Discrete Mathematics 165, 519-530, 1997 | 107 | 1997 |

Fulkerson′ s Conjecture and Circuit Covers GH Fan, A Raspaud Journal of Combinatorial Theory, Series B 61 (1), 133-138, 1994 | 102 | 1994 |

Acyclic and k-distance coloring of the grid G Fertin, E Godard, A Raspaud Information Processing Letters 87 (1), 51-58, 2003 | 101 | 2003 |

The chromatic number of a signed graph E Máčajová, A Raspaud, M Škoviera arXiv preprint arXiv:1412.6349, 2014 | 96 | 2014 |

On the vertex-arboricity of planar graphs A Raspaud, W Wang European Journal of Combinatorics 29 (4), 1064-1075, 2008 | 88 | 2008 |

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 | 80 | 2002 |

Colored homomorphisms of colored mixed graphs J Nešetřil, A Raspaud Journal of Combinatorial Theory, Series B 80 (1), 147-155, 2000 | 79 | 2000 |

Generalized power domination of graphs GJ Chang, P Dorbec, M Montassier, A Raspaud Discrete applied mathematics 160 (12), 1691-1698, 2012 | 78 | 2012 |

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 | 77 | 2003 |

A survey on Knödel graphs G Fertin, A Raspaud Discrete Applied Mathematics 137 (2), 173-195, 2004 | 75 | 2004 |

On star coloring of graphs G Fertin, A Raspaud, B Reed Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001 | 71 | 2001 |

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 | 62 | 2009 |

Two edge-disjoint Hamiltonian cycles in the butterfly graph D Barth, A Raspaud Information processing letters 51 (4), 175-179, 1994 | 62 | 1994 |

Injective coloring of planar graphs Y Bu, D Chen, A Raspaud, W Wang Discrete Applied Mathematics 157 (4), 663-672, 2009 | 58 | 2009 |