A New Proof of Wedderburn's Theorem. - Nicolas Lichiardopol (Am. Math. Mon., 2003)

Echange total, diffusion et quelques résultats sur les itérés de line-digraphs. (Total exchange, broadcasting and some results on iterated line digraphs). - Nicolas Lichiardopol (2003)

Broadcast time and connectivity. - Nicolas Lichiardopol (Discret. Appl. Math., 2004)

Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph. - Nicolas Lichiardopol (Discret. Math., 2004)

Independence number of iterated line digraphs. - Nicolas Lichiardopol (Discret. Math., 2005)

Independence number of de Bruijn graphs. - Nicolas Lichiardopol (Discret. Math., 2006)

Two proofs of Bermond-Thomassen conjecture for regular tournaments. - Stéphane Bessy; Nicolas Lichiardopol; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Cycles in a tournament with pairwise zero, one or two given vertices in common. - Nicolas Lichiardopol (Discret. Math., 2008)

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. - Nicolas Lichiardopol (Discret. Math., 2008)

A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs. - Nicolas Lichiardopol; Attila Pór; Jean-Sébastien Sereni (SIAM J. Discret. Math., 2009)

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. - Stéphane Bessy; Nicolas Lichiardopol; Jean-Sébastien Sereni (Discret. Math., 2010)

Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree. - Nicolas Lichiardopol (Discret. Math., 2010)

A new bound for a particular case of the Caccetta-Häggkvist conjecture. - Nicolas Lichiardopol (Discret. Math., 2010)

On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound. - Nicolas Lichiardopol (Australas. J Comb., 2011)

Vertex-disjoint cycles in regular tournaments. - Nicolas Lichiardopol (Discret. Math., 2012)

Proof of the Caccetta-Häggkvist conjecture for in-tournaments with respect to the minimum outdegree, and pancyclicity. - Nicolas Lichiardopol (Australas. J Comb., 2013)

Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two. - Nicolas Lichiardopol (Discret. Math., 2013)

New Ore's Type Results on Hamiltonicity and Existence of Paths of Given Length in Graphs. - Nicolas Lichiardopol (Graphs Comb., 2013)

New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth. - Nicolas Lichiardopol (Discret. Math., 2014)

Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles. - Nicolas Lichiardopol (SIAM J. Discret. Math., 2014)

A Linear Bound towards the Traceability Conjecture. - Susan A. van Aardt; Jean E. Dunbar; Marietjie Frick; Nicolas Lichiardopol (Electron. J. Comb., 2015)

Vertex-disjoint subgraphs with high degree sums. - Shuya Chiba; Nicolas Lichiardopol (Electron. Notes Discret. Math., 2015)

Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs. - Nicolas Lichiardopol (Discret. Appl. Math., 2016)

Triangle-free oriented graphs and the traceability conjecture. - Nicolas Lichiardopol (Discret. Math., 2016)

Disjoint Cycles of Different Lengths in Graphs and Digraphs. - Julien Bensmail; Ararat Harutyunyan; Ngoc-Khang Le; Binlong Li; Nicolas Lichiardopol (Electron. J. Comb., 2017)

Distance domination in graphs with given minimum and maximum degree. - Michael A. Henning; Nicolas Lichiardopol (J. Comb. Optim., 2017)

On the existence of vertex-disjoint subgraphs with high degree sum. - Shuya Chiba; Nicolas Lichiardopol (Discret. Appl. Math., 2018)

On the size of maximally non-hamiltonian digraphs. - Nicolas Lichiardopol; Carol T. Zamfirescu (Ars Math. Contemp., 2019)

Edge clique covers in graphs with independence number two. - Pierre Charbit; Gena Hahn; Marcin Kaminski 001; Manuel Lafond; Nicolas Lichiardopol; Reza Naserasr; Ben Seamone; Rezvan Sherkati (J. Graph Theory, 2021)