2009 |
37 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
On the perfect matching index of bridgeless cubic graphs
CoRR abs/0904.1296: (2009) |
2008 |
36 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
On $(P_5,\bar{P_5})$-sparse graphs and other families
CoRR abs/0803.2135: (2008) |
35 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
On parcimonious edge-colouring of graphs with maximum degree three
CoRR abs/0809.4747: (2008) |
34 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
On Fan Raspaud Conjecture
CoRR abs/0809.4821: (2008) |
33 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
On normal odd partitions in cubic graphs
CoRR abs/0809.4822: (2008) |
32 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
Kaiser and Raspaud conjecture on cubic Graphs with few vertices
CoRR abs/0809.4839: (2008) |
2007 |
31 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
On bipartite graphs with weak density of some subgraphs.
Discrete Mathematics 307(11-12): 1516-1524 (2007) |
2006 |
30 | EE | Jean-Luc Fouquet,
Henri Thuillier,
Jean-Marie Vanherpe,
A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs.
Electronic Notes in Discrete Mathematics 24: 277-284 (2006) |
2004 |
29 | EE | Jean-Luc Fouquet,
Michel Habib,
Fabien de Montgolfier,
Jean-Marie Vanherpe:
Bimodular Decomposition of Bipartite Graphs.
WG 2004: 117-128 |
28 | EE | Jean-Luc Fouquet,
Irena Rusu:
Preface.
Discrete Mathematics 276(1-3): 1-2 (2004) |
27 | EE | Jean-Luc Fouquet,
Jean-Marie Vanherpe:
On I-sparse graphs and other families: Extended abstract.
Electronic Notes in Discrete Mathematics 17: 163-167 (2004) |
2002 |
26 | EE | Jean-Luc Fouquet:
No odd pairs in minimal imperfect NP5 graphs.
Inf. Process. Lett. 83(4): 201-204 (2002) |
2001 |
25 | | Jean-Luc Fouquet,
Gena Hahn:
Cycle regular graphs need not be transitive.
Discrete Applied Mathematics 113(2-3): 261-264 (2001) |
24 | EE | Vincent Barré,
Jean-Luc Fouquet:
On minimal cutsets in P5-free minimal imperfect graphs.
Discrete Mathematics 236(1-3): 25-36 (2001) |
23 | EE | Jean-Luc Fouquet,
Florian Roussel,
P. Rubio,
Henri Thuillier:
New classes of perfectly orderable graphs.
Discrete Mathematics 236(1-3): 95-109 (2001) |
1999 |
22 | EE | Vincent Barré,
Jean-Luc Fouquet:
On Minimal Imperfect Graphs Without Induced P5.
Discrete Applied Mathematics 94(1-3): 9-33 (1999) |
21 | | Jean-Luc Fouquet,
Vassilis Giakoumakis,
Jean-Marie Vanherpe:
Bipartite Graphs Totally Decomposable by Canonical Decomposition.
Int. J. Found. Comput. Sci. 10(4): 513-534 (1999) |
1997 |
20 | EE | Jean-Luc Fouquet,
Pierre Rosenstiehl:
Preface.
Discrete Mathematics 165-166: 1-2 (1997) |
19 | EE | Jean-Luc Fouquet,
Vassilis Giakoumakis:
On semi-P4-sparse graphs.
Discrete Mathematics 165-166: 277-300 (1997) |
18 | EE | Jean-Luc Fouquet,
Frédéric Maire,
Irena Rusu,
Henri Thuillier:
On transversals in minimal imperfect graphs.
Discrete Mathematics 165-166: 301-312 (1997) |
17 | EE | C. Berge,
Jean-Luc Fouquet:
On the optimal transversals of the odd cycles.
Discrete Mathematics 169(1-3): 169-175 (1997) |
16 | EE | Jean-Luc Fouquet,
Igor Parfenoff,
Henri Thuillier:
An O(n) Time Algorithm for Maximum Matching in P4-Tidy Graphs.
Inf. Process. Lett. 62(6): 281-287 (1997) |
1995 |
15 | EE | Jean-Luc Fouquet,
Vassilis Giakoumakis,
Frédéric Maire,
Henri Thuillier:
On graphs without P5 and P5_.
Discrete Mathematics 146(1-3): 33-44 (1995) |
1994 |
14 | EE | Evelyne Flandrin,
Jean-Luc Fouquet,
Hao Li:
Hamiltonicity of Bipartite Biclaw-free Graphs.
Discrete Applied Mathematics 51(1-2): 95-102 (1994) |
13 | EE | Odile Favaron,
Jean-Luc Fouquet:
On m-centers in Pt-free graphs.
Discrete Mathematics 125(1-3): 147-152 (1994) |
12 | EE | Dominique Bénard,
Jean-Luc Fouquet:
Expansion of Centered Triangulations.
J. Comb. Theory, Ser. B 61(1): 92-102 (1994) |
1993 |
11 | EE | Evelyne Flandrin,
Jean-Luc Fouquet,
Hao Li:
On hamiltonian claw-free graphs.
Discrete Mathematics 111(1-3): 221-229 (1993) |
10 | EE | Jean-Luc Fouquet,
Henri Thuillier:
Decomposition of 3-connected cubic graphs.
Discrete Mathematics 114(1-3): 181-198 (1993) |
9 | EE | Jean-Luc Fouquet:
A decomposition for a class of (P5, P5_5)-free graphs.
Discrete Mathematics 121(1-3): 75-83 (1993) |
8 | EE | Jean-Luc Fouquet,
A. Pawel Wojda:
Mutual placement of bipartite graphs.
Discrete Mathematics 121(1-3): 85-92 (1993) |
7 | EE | Jean-Luc Fouquet:
A Strengthening of Ben Rebea's Lemma.
J. Comb. Theory, Ser. B 59(1): 35-40 (1993) |
1990 |
6 | EE | Jean-Luc Fouquet,
Henri Thuillier:
On some conjectures on cubic 3-connected graphs.
Discrete Mathematics 80(1): 41-57 (1990) |
1987 |
5 | EE | Abdelhamid Benhocine,
Jean-Luc Fouquet:
The Chvátal-Erdös condition and pancyclic line-graphs.
Discrete Mathematics 66(1-2): 21-26 (1987) |
1986 |
4 | EE | Dominique Bénard,
André Bouchet,
Jean-Luc Fouquet:
(m)-covering of a triangulation.
Discrete Mathematics 62(3): 261-270 (1986) |
1984 |
3 | EE | Jean-Claude Bermond,
Jean-Luc Fouquet,
Michel Habib,
Bernard Péroche:
On linear k-arboricity.
Discrete Mathematics 52(2-3): 123-132 (1984) |
1982 |
2 | EE | Jean-Luc Fouquet:
Note sur la non existence d'un snark d'ordre 16.
Discrete Mathematics 38(2-3): 163-171 (1982) |
1981 |
1 | EE | Jean-Luc Fouquet,
J. L. Jolivet,
M. Rivière:
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre.
J. Comb. Theory, Ser. B 31(3): 262-281 (1981) |