 | 2009 |
|---|
| 6 |       | Etienne Birmelé:
A scale-free graph model based on bipartite graphs.
Discrete Applied Mathematics 157(10): 2267-2284 (2009) |
| 5 | | Etienne Birmelé,
John Adrian Bondy,
Bruce A. Reed:
Tree-width of graphs without a 3×3 grid minor.
Discrete Applied Mathematics 157(12): 2577-2596 (2009) |
| 4 | | Etienne Birmelé,
François Delbot,
Christian Laforest:
Mean analysis of an online algorithm for the vertex cover problem.
Inf. Process. Lett. 109(9): 436-439 (2009) |
| 2008 |
|---|
| 3 | | 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 | | 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 | | 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) |
