default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Lichiardopol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j28]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): 324-339 (2021)
2010 – 2019
- 2019
- [j27]Nicolas Lichiardopol, Carol T. Zamfirescu:
On the size of maximally non-hamiltonian digraphs. Ars Math. Contemp. 16(1): 59-66 (2019) - 2018
- [j26]Shuya Chiba, Nicolas Lichiardopol:
On the existence of vertex-disjoint subgraphs with high degree sum. Discret. Appl. Math. 236: 84-95 (2018) - 2017
- [j25]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): 4 (2017) - [j24]Michael A. Henning, Nicolas Lichiardopol:
Distance domination in graphs with given minimum and maximum degree. J. Comb. Optim. 34(2): 545-553 (2017) - 2016
- [j23]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: 106-110 (2016) - [j22]Nicolas Lichiardopol:
Triangle-free oriented graphs and the traceability conjecture. Discret. Math. 339(2): 800-803 (2016) - 2015
- [j21]Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Nicolas Lichiardopol:
A Linear Bound towards the Traceability Conjecture. Electron. J. Comb. 22(4): 4 (2015) - [j20]Shuya Chiba, Nicolas Lichiardopol:
Vertex-disjoint subgraphs with high degree sums. Electron. Notes Discret. Math. 49: 359-366 (2015) - 2014
- [j19]Nicolas Lichiardopol:
New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth. Discret. Math. 332: 55-59 (2014) - [j18]Nicolas Lichiardopol:
Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles. SIAM J. Discret. Math. 28(3): 1618-1627 (2014) - 2013
- [j17]Nicolas Lichiardopol:
Proof of the Caccetta-Häggkvist conjecture for in-tournaments with respect to the minimum outdegree, and pancyclicity. Australas. J Comb. 57: 313- (2013) - [j16]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): 1540-1542 (2013) - [j15]Nicolas Lichiardopol:
New Ore's Type Results on Hamiltonicity and Existence of Paths of Given Length in Graphs. Graphs Comb. 29(1): 99-104 (2013) - 2012
- [j14]Nicolas Lichiardopol:
Vertex-disjoint cycles in regular tournaments. Discret. Math. 312(12-13): 1927-1930 (2012) - 2011
- [j13]Nicolas Lichiardopol:
On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound. Australas. J Comb. 51: 7-28 (2011) - 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. Discret. Math. 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. Discret. Math. 310(19): 2567-2570 (2010) - [j10]Nicolas Lichiardopol:
A new bound for a particular case of the Caccetta-Häggkvist conjecture. Discret. Math. 310(23): 3368-3372 (2010)
2000 – 2009
- 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. Discret. Math. 23(2): 979-992 (2009) - 2008
- [j8]Nicolas Lichiardopol:
Cycles in a tournament with pairwise zero, one or two given vertices in common. Discret. Math. 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. Discret. Math. 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. Electron. Notes Discret. Math. 28: 47-53 (2007) - 2006
- [j5]Nicolas Lichiardopol:
Independence number of de Bruijn graphs. Discret. Math. 306(12): 1145-1160 (2006) - 2005
- [j4]Nicolas Lichiardopol:
Independence number of iterated line digraphs. Discret. Math. 293(1-3): 185-193 (2005) - 2004
- [j3]Nicolas Lichiardopol:
Broadcast time and connectivity. Discret. Appl. Math. 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. Discret. Math. 280(1-3): 119-131 (2004) - 2003
- [b1]Nicolas Lichiardopol:
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). University of Nice Sophia Antipolis, France, 2003 - [j1]Nicolas Lichiardopol:
A New Proof of Wedderburn's Theorem. Am. Math. Mon. 110(8): 736-737 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
