The SCEAS System
Navigation Menu

Search the dblp DataBase


Nicolas Lichiardopol: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicolas Lichiardopol
    Broadcast time and connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:359-363 [Journal]
  2. Nicolas Lichiardopol
    Independence number of iterated line digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:185-193 [Journal]
  3. Nicolas Lichiardopol
    Independence number of de Bruijn graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1145-1160 [Journal]
  4. Nicolas Lichiardopol
    Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:119-131 [Journal]

  5. Cycles in a tournament with pairwise zero, one or two given vertices in common. [Citation Graph (, )][DBLP]

  6. 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. [Citation Graph (, )][DBLP]

  7. Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. [Citation Graph (, )][DBLP]

  8. Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002