- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j15 |      | Nicolas Lichiardopol: Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two. Discrete Mathematics 313(14): 1540-1542 (2013) |
| j14 | | Nicolas Lichiardopol: New Ore's Type Results on Hamiltonicity and Existence of Paths of Given Length in Graphs. Graphs and Combinatorics 29(1): 99-104 (2013) |
| 2012 | ||
| j13 | | Nicolas Lichiardopol: Vertex-disjoint cycles in regular tournaments. Discrete Mathematics 312(12-13): 1927-1930 (2012) |
| 2010 | ||
| j12 | | Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni: Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discrete Mathematics 310(3): 557-560 (2010) |
| j11 | | Nicolas Lichiardopol: Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree. Discrete Mathematics 310(19): 2567-2570 (2010) |
| j10 | | Nicolas Lichiardopol: A new bound for a particular case of the Caccetta-Häggkvist conjecture. Discrete Mathematics 310(23): 3368-3372 (2010) |
| 2009 | ||
| j9 | | Nicolas Lichiardopol, Attila Pór, Jean-Sébastien Sereni: A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs. SIAM J. Discrete Math. 23(2): 979-992 (2009) |
| 2008 | ||
| j8 | | Nicolas Lichiardopol: Cycles in a tournament with pairwise zero, one or two given vertices in common. Discrete Mathematics 308(5-6): 763-771 (2008) |
| j7 | | 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) |
| 2007 | ||
| j6 | | 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 | ||
| j5 | | Nicolas Lichiardopol: Independence number of de Bruijn graphs. Discrete Mathematics 306(12): 1145-1160 (2006) |
| 2005 | ||
| j4 | | Nicolas Lichiardopol: Independence number of iterated line digraphs. Discrete Mathematics 293(1-3): 185-193 (2005) |
| 2004 | ||
| j3 | | Nicolas Lichiardopol: Broadcast time and connectivity. Discrete Applied Mathematics 143(1-3): 359-363 (2004) |
| j2 | | 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) |
| 2003 | ||
| j1 | | Nicolas Lichiardopol: A New Proof of Wedderburn's Theorem. The American Mathematical Monthly 110(8): 736-737 (2003) |
| 1 | Stéphane Bessy | |
| 2 | Attila Pór | |
| 3 | Jean-Sébastien Sereni |
Data released under the ODC-BY 1.0 license — See also our legal information page