| |
| 2008 | ||
|---|---|---|
| 3 | EE | Etienne Birmelé: Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord. Journal of Graph Theory 58(4): 293-298 (2008) |
| 2007 | ||
| 2 | EE | Etienne Birmelé, John Adrian Bondy, Bruce A. Reed: The Erdös-Pósa Property For Long Circuits. Combinatorica 27(2): 135-145 (2007) |
| 2006 | ||
| 1 | EE | Stéphane Bessy, Frédéric Havet, Etienne Birmelé: Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. Journal of Graph Theory 53(4): 315-332 (2006) |
| 1 | Stéphane Bessy | [1] |
| 2 | John Adrian Bondy | [2] |
| 3 | Frédéric Havet | [1] |
| 4 | Bruce A. Reed | [2] |