| |
| 2008 | ||
|---|---|---|
| 7 | EE | Nicolas Lichiardopol: A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture. Discrete Mathematics 308(22): 5274-5279 (2008) |
| 6 | EE | Nicolas Lichiardopol: Cycles in a tournament with pairwise zero, one or two given vertices in common. Discrete Mathematics 308(5-6): 763-771 (2008) |
| 2007 | ||
| 5 | EE | Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni: Two proofs of Bermond-Thomassen conjecture for regular tournaments. Electronic Notes in Discrete Mathematics 28: 47-53 (2007) |
| 2006 | ||
| 4 | EE | Nicolas Lichiardopol: Independence number of de Bruijn graphs. Discrete Mathematics 306(12): 1145-1160 (2006) |
| 2005 | ||
| 3 | EE | Nicolas Lichiardopol: Independence number of iterated line digraphs. Discrete Mathematics 293(1-3): 185-193 (2005) |
| 2004 | ||
| 2 | EE | Nicolas Lichiardopol: Broadcast time and connectivity. Discrete Applied Mathematics 143(1-3): 359-363 (2004) |
| 1 | EE | Nicolas Lichiardopol: Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph. Discrete Mathematics 280(1-3): 119-131 (2004) |
| 1 | Stéphane Bessy | [5] |
| 2 | Jean-Sébastien Sereni | [5] |