Nicolas Lichiardopol

Publication Activity (10 Years)

Years Active: 2003-2021
Publications (10 Years): 9

Top Venues

Discret. Math.

Electron. J. Comb.

Discret. Appl. Math.

J. Comb. Optim.

University of Nice Sophia Antipolis, France (PHD)

Education History

University of Nice Sophia Antipolis, France

PHD

Publications

Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati
Edge clique covers in graphs with independence number two. J. Graph Theory 97 (2) (2021)
Nicolas Lichiardopol, Carol T. Zamfirescu
On the size of maximally non-hamiltonian digraphs. Ars Math. Contemp. 16 (1) (2019)
Shuya Chiba, Nicolas Lichiardopol
On the existence of vertex-disjoint subgraphs with high degree sum. Discret. Appl. Math. 236 (2018)
Michael A. Henning, Nicolas Lichiardopol
Distance domination in graphs with given minimum and maximum degree. J. Comb. Optim. 34 (2) (2017)
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol
Disjoint Cycles of Different Lengths in Graphs and Digraphs. Electron. J. Comb. 24 (4) (2017)
Nicolas Lichiardopol
Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs. Discret. Appl. Math. 202 (2016)
Nicolas Lichiardopol
Triangle-free oriented graphs and the traceability conjecture. Discret. Math. 339 (2) (2016)
Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Nicolas Lichiardopol
A Linear Bound towards the Traceability Conjecture. Electron. J. Comb. 22 (4) (2015)
Shuya Chiba, Nicolas Lichiardopol
Vertex-disjoint subgraphs with high degree sums. Electron. Notes Discret. Math. 49 (2015)
Nicolas Lichiardopol
New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth. Discret. Math. 332 (2014)
Nicolas Lichiardopol
Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles. SIAM J. Discret. Math. 28 (3) (2014)
Nicolas Lichiardopol
Proof of the Caccetta-Häggkvist conjecture for in-tournaments with respect to the minimum outdegree, and pancyclicity. Australas. J Comb. 57 (2013)
Nicolas Lichiardopol
Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two. Discret. Math. 313 (14) (2013)
Nicolas Lichiardopol
New Ore's Type Results on Hamiltonicity and Existence of Paths of Given Length in Graphs. Graphs Comb. 29 (1) (2013)
Nicolas Lichiardopol
Vertex-disjoint cycles in regular tournaments. Discret. Math. 312 (12-13) (2012)
Nicolas Lichiardopol
On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound. Australas. J Comb. 51 (2011)
Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discret. Math. 310 (3) (2010)
Nicolas Lichiardopol
A new bound for a particular case of the Caccetta-Häggkvist conjecture. Discret. Math. 310 (23) (2010)
Nicolas Lichiardopol
Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree. Discret. Math. 310 (19) (2010)
Nicolas Lichiardopol, Attila Pór, Jean-Sébastien Sereni
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs. SIAM J. Discret. Math. 23 (2) (2009)
Nicolas Lichiardopol
Cycles in a tournament with pairwise zero, one or two given vertices in common. Discret. Math. 308 (5-6) (2008)
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. Discret. Math. 308 (22) (2008)
Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni
Two proofs of Bermond-Thomassen conjecture for regular tournaments. Electron. Notes Discret. Math. 28 (2007)
Nicolas Lichiardopol
Independence number of de Bruijn graphs. Discret. Math. 306 (12) (2006)
Nicolas Lichiardopol
Independence number of iterated line digraphs. Discret. Math. 293 (1-3) (2005)
Nicolas Lichiardopol
Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph. Discret. Math. 280 (1-3) (2004)
Nicolas Lichiardopol
Broadcast time and connectivity. Discret. Appl. Math. 143 (1-3) (2004)
Nicolas Lichiardopol
A New Proof of Wedderburn's Theorem. Am. Math. Mon. 110 (8) (2003)

Nicolas Lichiardopol.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicolas Lichiardopol