The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Evelyne Flandrin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
    Shortest walks in almost claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  2. Evelyne Flandrin, Jean-Luc Fouquet, Hao Li
    Hamiltonicity of Bipartite Biclaw-free Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:95-102 [Journal]
  3. Mohamed El Kadi Abderrezzak, Evelyne Flandrin
    New sufficient conditions for bipancyclic bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:5-13 [Journal]
  4. Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Denise Amar
    Cyclability and pancyclability in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:3-11 [Journal]
  5. Roman Cada, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
    Cycles through given vertices and closures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:65-80 [Journal]
  6. Mao-cheng Cai, Evelyne Flandrin, Hao Li
    On quasifactorability in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:85-92 [Journal]
  7. Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
    Clique covering and degree conditions for hamiltonicity in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:65-80 [Journal]
  8. Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
    A note on pancyclism of highly connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:57-60 [Journal]
  9. Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
    A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:878-884 [Journal]
  10. Hao Li, Evelyne Flandrin, Jinlong Shu
    A sufficient condition for cyclability in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1291-1297 [Journal]
  11. Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda
    Bipartite graphs with every matching in a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1525-1537 [Journal]
  12. Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
    A Chvátal-Erdos type condition for pancyclability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1463-1466 [Journal]
  13. Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
    A Note on a Generalisation of Ore's Condition. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:213-216 [Journal]
  14. Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa
    Hamiltonian pancyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:3, pp:327- [Journal]
  15. Evelyne Flandrin, Feng Tian, Bing Wei, Lei Zhang
    Some properties of 3-domination-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:65-76 [Journal]
  16. Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian
    An Ore-type condition for pancyclability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:139-144 [Journal]
  17. Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu
    On 2-factors in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:131-137 [Journal]
  18. Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Zdenek Ryjácek
    Induced S(K1, 3) and hamiltonian cycles in the square of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:263-269 [Journal]
  19. Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek
    Claw-free graphs - A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:87-147 [Journal]
  20. Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Amel Harkat-Benhamdine, Hao Li
    Dlambda-cycles in lambda-claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:11-20 [Journal]
  21. Denise Amar, Evelyne Flandrin, I. Fournier, Anne Germa
    Pancyclism in hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:2, pp:111-131 [Journal]
  22. Evelyne Flandrin, H. A. Jung, Hao Li
    Hamiltonism, degree sum and neighborhood intersections. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:1, pp:41-52 [Journal]
  23. Evelyne Flandrin, Jean-Luc Fouquet, Hao Li
    On hamiltonian claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:221-229 [Journal]
  24. Daniel Barraez, Evelyne Flandrin, Hao Li, Oscar Ordaz
    Dominating cycles in bipartite biclaw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:11-18 [Journal]

  25. Neighborhood unions and extremal spanning trees. [Citation Graph (, )][DBLP]


  26. A sufficient condition for pancyclability of graphs. [Citation Graph (, )][DBLP]


  27. Hamiltonicity and pancyclicity of cartesian products of graphs. [Citation Graph (, )][DBLP]


  28. A degree condition implying that every matching is contained in a hamiltonian cycle. [Citation Graph (, )][DBLP]


  29. Cyclability in k-connected K1, 4-free graphs. [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.037secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002