The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Luc Fouquet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
    Bimodular Decomposition of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:117-128 [Conf]
  2. Vincent Barré, Jean-Luc Fouquet
    On Minimal Imperfect Graphs Without Induced P5. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:9-33 [Journal]
  3. 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]
  4. Jean-Luc Fouquet, Gena Hahn
    Cycle regular graphs need not be transitive. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:261-264 [Journal]
  5. Vincent Barré, Jean-Luc Fouquet
    On minimal cutsets in P5-free minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:25-36 [Journal]
  6. Jean-Luc Fouquet, Irena Rusu
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:1-2 [Journal]
  7. Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier
    New classes of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:95-109 [Journal]
  8. Jean-Luc Fouquet, Jean-Marie Vanherpe
    On bipartite graphs with weak density of some subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1516-1524 [Journal]
  9. Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe
    Bipartite Graphs Totally Decomposable by Canonical Decomposition. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:513-534 [Journal]
  10. Jean-Luc Fouquet
    No odd pairs in minimal imperfect NP5 graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:4, pp:201-204 [Journal]
  11. Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier
    An O(n) Time Algorithm for Maximum Matching in P4-Tidy Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:281-287 [Journal]
  12. Dominique Bénard, Jean-Luc Fouquet
    Expansion of Centered Triangulations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:92-102 [Journal]
  13. Jean-Luc Fouquet
    A Strengthening of Ben Rebea's Lemma. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:59, n:1, pp:35-40 [Journal]
  14. Jean-Luc Fouquet, J. L. Jolivet, M. Rivière
    Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:262-281 [Journal]
  15. Jean-Luc Fouquet
    Note sur la non existence d'un snark d'ordre 16. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:163-171 [Journal]
  16. Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche
    On linear k-arboricity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:123-132 [Journal]
  17. Dominique Bénard, André Bouchet, Jean-Luc Fouquet
    (m)-covering of a triangulation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:261-270 [Journal]
  18. Abdelhamid Benhocine, Jean-Luc Fouquet
    The Chvátal-Erdös condition and pancyclic line-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:21-26 [Journal]
  19. Jean-Luc Fouquet, Henri Thuillier
    On some conjectures on cubic 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:1, pp:41-57 [Journal]
  20. C. Berge, Jean-Luc Fouquet
    On the optimal transversals of the odd cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:169-175 [Journal]
  21. Jean-Luc Fouquet, Pierre Rosenstiehl
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:1-2 [Journal]
  22. Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier
    On transversals in minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:301-312 [Journal]
  23. Jean-Luc Fouquet, Vassilis Giakoumakis
    On semi-P4-sparse graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:277-300 [Journal]
  24. 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]
  25. Jean-Luc Fouquet, Henri Thuillier
    Decomposition of 3-connected cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:181-198 [Journal]
  26. Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier
    On graphs without P5 and P5_. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:33-44 [Journal]
  27. Jean-Luc Fouquet
    A decomposition for a class of (P5, P5_5)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:75-83 [Journal]
  28. Jean-Luc Fouquet, A. Pawel Wojda
    Mutual placement of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:85-92 [Journal]
  29. Odile Favaron, Jean-Luc Fouquet
    On m-centers in Pt-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:147-152 [Journal]

  30. On $(P_5,\bar{P_5})$-sparse graphs and other families [Citation Graph (, )][DBLP]


  31. On parcimonious edge-colouring of graphs with maximum degree three [Citation Graph (, )][DBLP]


  32. On Fan Raspaud Conjecture [Citation Graph (, )][DBLP]


  33. On normal odd partitions in cubic graphs [Citation Graph (, )][DBLP]


  34. Kaiser and Raspaud conjecture on cubic Graphs with few vertices [Citation Graph (, )][DBLP]


  35. On the perfect matching index of bridgeless cubic graphs [Citation Graph (, )][DBLP]


  36. On Fulkerson conjecture [Citation Graph (, )][DBLP]


  37. Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs [Citation Graph (, )][DBLP]


  38. On a family of cubic graphs containing the flower snarks [Citation Graph (, )][DBLP]


  39. On isomorphic linear partitions in cubic graphs. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.030secs
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