SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

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

Publications of Author

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]
Vincent Barré, Jean-Luc Fouquet
On Minimal Imperfect Graphs Without Induced P₅. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:9-33 [Journal]
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]
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]
Vincent Barré, Jean-Luc Fouquet
On minimal cutsets in P₅-free minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:236, n:1-3, pp:25-36 [Journal]
Jean-Luc Fouquet, Irena Rusu
Preface. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:276, n:1-3, pp:1-2 [Journal]
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]
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]
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]
Jean-Luc Fouquet
No odd pairs in minimal imperfect NP₅ graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2002, v:83, n:4, pp:201-204 [Journal]
Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier
An O(n) Time Algorithm for Maximum Matching in P₄-Tidy Graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:62, n:6, pp:281-287 [Journal]
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]
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]
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]
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]
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]
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]
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]
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]
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]
Jean-Luc Fouquet, Pierre Rosenstiehl
Preface. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:165, n:, pp:1-2 [Journal]
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]
Jean-Luc Fouquet, Vassilis Giakoumakis
On semi-P₄-sparse graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:165, n:, pp:277-300 [Journal]
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]
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]
Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier
On graphs without P₅ and P₅^_. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:146, n:1-3, pp:33-44 [Journal]
Jean-Luc Fouquet
A decomposition for a class of (P₅, P₅^_₅)-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:121, n:1-3, pp:75-83 [Journal]
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]
Odile Favaron, Jean-Luc Fouquet
On m-centers in P_t-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1994, v:125, n:1-3, pp:147-152 [Journal]
On $(P_5,\bar{P_5})$-sparse graphs and other families [Citation Graph (, )][DBLP]
On parcimonious edge-colouring of graphs with maximum degree three [Citation Graph (, )][DBLP]
On Fan Raspaud Conjecture [Citation Graph (, )][DBLP]
On normal odd partitions in cubic graphs [Citation Graph (, )][DBLP]
Kaiser and Raspaud conjecture on cubic Graphs with few vertices [Citation Graph (, )][DBLP]
On the perfect matching index of bridgeless cubic graphs [Citation Graph (, )][DBLP]
On Fulkerson conjecture [Citation Graph (, )][DBLP]
Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs [Citation Graph (, )][DBLP]
On a family of cubic graphs containing the flower snarks [Citation Graph (, )][DBLP]
On isomorphic linear partitions in cubic graphs. [Citation Graph (, )][DBLP]

Search in 0.044secs, Finished in 0.046secs

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