2003 |
23 | EE | Benjamin Buffereau,
Pierre Duchet,
Philippe Picouet:
Generating Guided Tours to Facilitate Learning from a Set of Indexed Resources.
ICALT 2003: 492 |
22 | | Benjamin Buffereau,
Pierre Duchet,
Philippe Picouet:
Generating Guided Tours over Indexed Information Resources.
ICWI 2003: 1051-1056 |
2000 |
21 | | Stefan Janaqi,
Pierre Duchet:
Generator-Preserving contractions and a Min-Max result on the graphs of planar polyominoes.
Ars Comb. 55: (2000) |
20 | EE | Raul Cordovil,
Pierre Duchet:
Cyclic Polytopes and Oriented Matroids.
Eur. J. Comb. 21(1): 49-64 (2000) |
1999 |
19 | EE | Mostafa Blidia,
Pierre Duchet,
Henry Jacob,
Frédéric Maffray,
Henry Meyniel:
Some operations preserving the existence of kernels.
Discrete Mathematics 205(1-3): 211-216 (1999) |
1994 |
18 | EE | Pierre Duchet,
Viktor Kaneti:
Sur la contractibilité d'un graphe orienté en K*4.
Discrete Mathematics 130(1-3): 57-68 (1994) |
1993 |
17 | | Mostafa Blidia,
Pierre Duchet,
Frédéric Maffray:
On kernels in perfect graphs.
Combinatorica 13(2): 231-233 (1993) |
16 | EE | Pierre Duchet,
Henry Meyniel:
Kernels in directed graphs: a poison game.
Discrete Mathematics 115(1-3): 273-276 (1993) |
1991 |
15 | EE | Pierre Duchet,
Stephan Olariu:
Graphes parfaitement ordonnables généralises.
Discrete Mathematics 90(1): 99-101 (1991) |
1990 |
14 | EE | Raul Cordovil,
Pierre Duchet:
On sign-invariance graphs of uniform oriented matroids.
Discrete Mathematics 79(3): 251-257 (1990) |
13 | EE | C. Berge,
Pierre Duchet:
Recent problems and results about kernels in directed graphs.
Discrete Mathematics 86(1-3): 27-31 (1990) |
1989 |
12 | EE | Pierre Duchet:
On locally-perfect colorings.
Discrete Mathematics 74(1-2): 29-32 (1989) |
1988 |
11 | EE | Pierre Duchet:
Convex sets in graphs, II. Minimal path convexity.
J. Comb. Theory, Ser. B 44(3): 307-316 (1988) |
1987 |
10 | EE | Pierre Duchet,
Viktor Kaneti:
Sur la contraction des graphes orientes en K*3.
Discrete Mathematics 65(1): 95-98 (1987) |
9 | EE | Pierre Duchet,
Yahya Ould Hamidoune,
Henry Meyniel:
Sur les quasi-noyaux d'un graphe.
Discrete Mathematics 65(3): 231-235 (1987) |
8 | EE | Pierre Duchet:
Parity graphs are kernel-M-solvable.
J. Comb. Theory, Ser. B 43(2): 121-126 (1987) |
1986 |
7 | EE | Raul Cordovil,
Pierre Duchet:
Separation par une droite dans les matroïdes orientes de rang 3.
Discrete Mathematics 62(1): 103-104 (1986) |
6 | EE | Pierre Duchet,
Michel Las Vergnas,
Henry Meyniel:
Connected cutsets of a graph and triangle bases of the cycle space.
Discrete Mathematics 62(2): 145-154 (1986) |
1983 |
5 | EE | Pierre Duchet,
Henry Meyniel:
Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes.
Discrete Mathematics 43(1): 21-27 (1983) |
4 | EE | Pierre Duchet,
Yahya Ould Hamidoune,
Michel Las Vergnas,
Henry Meyniel:
Representing a planar graph by vertical lines joining different levels.
Discrete Mathematics 46(3): 319-321 (1983) |
3 | EE | Andries E. Brouwer,
Pierre Duchet,
Alexander Schrijver:
Graphs whose neighborhoods have no special cycles.
Discrete Mathematics 47: 177-182 (1983) |
2 | EE | Béla Bollobás,
Pierre Duchet:
On Helly families of maximal size.
J. Comb. Theory, Ser. B 35(3): 290-296 (1983) |
1981 |
1 | EE | Pierre Duchet,
Henry Meyniel:
A note on kernel-critical graphs.
Discrete Mathematics 33(1): 103-105 (1981) |