We stand with Ukraine  

Nicolas Lichiardopol

According to our database1, Nicolas Lichiardopol authored at least 29 papers between 2003 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Edge clique covers in graphs with independence number two.
[BibTeX]
[DOI]
Pierre Charbit
,
Gena Hahn
,
Marcin Kaminski
,
Manuel Lafond
,
Nicolas Lichiardopol
,
Reza Naserasr
,
Ben Seamone
,
Rezvan Sherkati
J. Graph Theory, 2021

2019
On the size of maximally non-hamiltonian digraphs.
[BibTeX]
[DOI]
Nicolas Lichiardopol
,
Carol T. Zamfirescu
Ars Math. Contemp., 2019

2018
On the existence of vertex-disjoint subgraphs with high degree sum.
[BibTeX]
[DOI]
Shuya Chiba
,
Nicolas Lichiardopol
Discret. Appl. Math., 2018

2017
Distance domination in graphs with given minimum and maximum degree.
[BibTeX]
[DOI]
Michael A. Henning
,
Nicolas Lichiardopol
J. Comb. Optim., 2017

Disjoint Cycles of Different Lengths in Graphs and Digraphs.
[BibTeX]
[DOI]
Julien Bensmail
,
Ararat Harutyunyan
,
Ngoc-Khang Le
,
Binlong Li
,
Nicolas Lichiardopol
Electron. J. Comb., 2017

2016
Triangle-free oriented graphs and the traceability conjecture.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2016

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

2015
Vertex-disjoint subgraphs with high degree sums.
[BibTeX]
[DOI]
Shuya Chiba
,
Nicolas Lichiardopol
Electron. Notes Discret. Math., 2015

A Linear Bound towards the Traceability Conjecture.
[BibTeX]
[DOI]
Susan A. van Aardt
,
Jean E. Dunbar
,
Marietjie Frick
,
Nicolas Lichiardopol
Electron. J. Comb., 2015

2014
Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles.
[BibTeX]
[DOI]
Nicolas Lichiardopol
SIAM J. Discret. Math., 2014

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

2013
New Ore's Type Results on Hamiltonicity and Existence of Paths of Given Length in Graphs.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Graphs Comb., 2013

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

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

2012
Vertex-disjoint cycles in regular tournaments.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2012

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

2010
A new bound for a particular case of the Caccetta-Häggkvist conjecture.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2010

Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2010

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

2009
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs.
[BibTeX]
[DOI]
Nicolas Lichiardopol
,
Attila Pór
,
Jean-Sébastien Sereni
SIAM J. Discret. Math., 2009

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.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2008

Cycles in a tournament with pairwise zero, one or two given vertices in common.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2008

2007
Two proofs of Bermond-Thomassen conjecture for regular tournaments.
[BibTeX]
[DOI]
Stéphane Bessy
,
Nicolas Lichiardopol
,
Jean-Sébastien Sereni
Electron. Notes Discret. Math., 2007

2006
Independence number of de Bruijn graphs.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2006

2005
Independence number of iterated line digraphs.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2005

2004
Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Math., 2004

Broadcast time and connectivity.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Discret. Appl. Math., 2004

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).
[BibTeX]
[DOI]
Nicolas Lichiardopol
PhD thesis, 2003

A New Proof of Wedderburn's Theorem.
[BibTeX]
[DOI]
Nicolas Lichiardopol
Am. Math. Mon., 2003


  Loading...