André Raspaud

1. Acyclic list 7‐coloring of planar graphs
   2002/04/15 by O. V. Borodin, D. G. Fon‐Der Flaass, A.V. Kostochka +5 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Graph Labeling and Dimension Problems
2. Injective edge-coloring of graphs with given maximum degree
   2020/10/01 by Alexandr Kostochka, Kostochka, Alexandr, André Raspaud +3 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
3. A note on adaptable choosability and choosability with separation of\n planar graphs
   2020/10/30 by Carl Johan Casselgren, Casselgren, Carl Johan, Jonas B. Granholm +3 · 1 citation
   Computer Science · Social Sciences · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #French Urban and Social Studies #Graph Labeling and Dimension Problems #Optimization and Search Problems
4. A sufficient condition for planar graphs to be acyclically 5‐choosable
   2011/04/14 by Min Chen, André Raspaud · 1 citation
   Computer Science · #Advanced Graph Theory Research