Pierre Duchet

29 papers B 1Journal 27Unranked 1
YearRankTypeTitle / Venue / Authors
2003 — conf
Generating Guided Tours over Indexed Information Resources.
ICWI
Benjamin Buffereau, Pierre Duchet, Philippe Picouet
2003 B conf
Generating Guided Tours to Facilitate Learning from a Set of Indexed Resources.
ICALT
Benjamin Buffereau, Pierre Duchet, Philippe Picouet
2000 J jnl
Cyclic Polytopes and Oriented Matroids.
Eur. J. Comb.
Raul Cordovil, Pierre Duchet
2000 J jnl
Generator-Preserving contractions and a Min-Max result on the graphs of planar polyominoes.
Ars Comb.
Stefan Janaqi, Pierre Duchet
1999 J jnl
Some operations preserving the existence of kernels.
Discret. Math.
Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel
1994 J jnl
On the orientation of meyniel graphs.
J. Graph Theory
Mostafa Blidia, Pierre Duchet, Frédéric Maffray
1994 J jnl
Sur la contractibilité d'un graphe orienté en K
Discret. Math.
Pierre Duchet, Viktor Kaneti
1993 J jnl
Kernels in directed graphs: a poison game.
Discret. Math.
Pierre Duchet, Henry Meyniel
1993 J jnl
On kernels in perfect graphs.
Comb.
Mostafa Blidia, Pierre Duchet, Frédéric Maffray
1991 J jnl
Graphes parfaitement ordonnables généralises.
Discret. Math.
Pierre Duchet, Stephan Olariu
1990 J jnl
More characterizations of triangulated graphs.
J. Graph Theory
Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray
1990 J jnl
On sign-invariance graphs of uniform oriented matroids.
Discret. Math.
Raul Cordovil, Pierre Duchet
1990 J jnl
Recent problems and results about kernels in directed graphs.
Discret. Math.
Claude Berge, Pierre Duchet
1989 J jnl
On locally-perfect colorings.
Discret. Math.
Pierre Duchet
1988 J jnl
Convex sets in graphs, II. Minimal path convexity.
J. Comb. Theory B
Pierre Duchet
1987 J jnl
A sufficient condition for a digraph to be kernel-perfect.
J. Graph Theory
Pierre Duchet
1987 J jnl
Parity graphs are kernel-
J. Comb. Theory B
Pierre Duchet
1987 J jnl
Sur la contraction des graphes orientes en K
Discret. Math.
Pierre Duchet, Viktor Kaneti
1987 J jnl
Sur les quasi-noyaux d'un graphe.
Discret. Math.
Pierre Duchet, Yahya Ould Hamidoune, Henry Meyniel
1986 J jnl
Connected cutsets of a graph and triangle bases of the cycle space.
Discret. Math.
Pierre Duchet, Michel Las Vergnas, Henry Meyniel
1986 J jnl
Separation par une droite dans les matroïdes orientes de rang 3.
Discret. Math.
Raul Cordovil, Pierre Duchet
1983 J jnl
Ensemble Convexes dans les Graphes I: Théorèmes de Helly et de Radon pour Graphes et Surfaces.
Eur. J. Comb.
Pierre Duchet, Henry Meyniel
1983 J jnl
Graphs whose neighborhoods have no special cycles.
Discret. Math.
Andries E. Brouwer, Pierre Duchet, Alexander Schrijver
1983 J jnl
On Helly families of maximal size.
J. Comb. Theory B
Béla Bollobás, Pierre Duchet
1983 J jnl
Representing a planar graph by vertical lines joining different levels.
Discret. Math.
Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel
1983 J jnl
Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes.
Discret. Math.
Pierre Duchet, Henry Meyniel
1981 J jnl
A note on kernel-critical graphs.
Discret. Math.
Pierre Duchet, Henry Meyniel
1979 J jnl
Helly Families of Maximal Size.
J. Comb. Theory A
Béla Bollobás, Pierre Duchet
1974 J jnl
Sur les hypergraphes invariants.
Discret. Math.
Pierre Duchet