Pierre Duchet

According to our database, Pierre Duchet authored at least 28 papers between 1974 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2003

Generating Guided Tours to Facilitate Learning from a Set of Indexed Resources.

Benjamin Buffereau, Pierre Duchet, Philippe Picouet

Proceedings of the 2003 IEEE International Conference on Advanced Learning Technologies, 2003

Generating Guided Tours over Indexed Information Resources.

Benjamin Buffereau, Pierre Duchet, Philippe Picouet

Proceedings of the IADIS International Conference WWW/Internet 2003, 2003

2000

Cyclic Polytopes and Oriented Matroids.

Raul Cordovil, Pierre Duchet

Eur. J. Comb., 2000

Generator-Preserving contractions and a Min-Max result on the graphs of planar polyominoes.

Stefan Janaqi, Pierre Duchet

Ars Comb., 2000

1999

Some operations preserving the existence of kernels.

Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel

Discret. Math., 1999

1994

On the orientation of meyniel graphs.

Mostafa Blidia, Pierre Duchet, Frédéric Maffray

J. Graph Theory, 1994

Sur la contractibilité d'un graphe orienté en K^*₄.

Pierre Duchet, Viktor Kaneti

Discret. Math., 1994

1993

Kernels in directed graphs: a poison game.

Pierre Duchet, Henry Meyniel

Discret. Math., 1993

On kernels in perfect graphs.

Mostafa Blidia, Pierre Duchet, Frédéric Maffray

Comb., 1993

1991

Graphes parfaitement ordonnables généralises.

Pierre Duchet, Stephan Olariu

Discret. Math., 1991

1990

More characterizations of triangulated graphs.

Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray

J. Graph Theory, 1990

On sign-invariance graphs of uniform oriented matroids.

Raul Cordovil, Pierre Duchet

Discret. Math., 1990

Recent problems and results about kernels in directed graphs.

Claude Berge, Pierre Duchet

Discret. Math., 1990

1989

On locally-perfect colorings.

Pierre Duchet

Discret. Math., 1989

1988

Convex sets in graphs, II. Minimal path convexity.

Pierre Duchet

J. Comb. Theory, Ser. B, 1988

1987

A sufficient condition for a digraph to be kernel-perfect.

Pierre Duchet

J. Graph Theory, 1987

Parity graphs are kernel-<i>M</i>-solvable.

Pierre Duchet

J. Comb. Theory, Ser. B, 1987

Sur la contraction des graphes orientes en K^*₃.

Pierre Duchet, Viktor Kaneti

Discret. Math., 1987

Sur les quasi-noyaux d'un graphe.

Pierre Duchet, Yahya Ould Hamidoune, Henry Meyniel

Discret. Math., 1987

1986

Connected cutsets of a graph and triangle bases of the cycle space.

Pierre Duchet, Michel Las Vergnas, Henry Meyniel

Discret. Math., 1986

Separation par une droite dans les matroïdes orientes de rang 3.

Raul Cordovil, Pierre Duchet

Discret. Math., 1986

1983

Ensemble Convexes dans les Graphes I: Théorèmes de Helly et de Radon pour Graphes et Surfaces.

Pierre Duchet, Henry Meyniel

Eur. J. Comb., 1983

Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes.

Pierre Duchet, Henry Meyniel

Discret. Math., 1983

Representing a planar graph by vertical lines joining different levels.

Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel

Discret. Math., 1983

Graphs whose neighborhoods have no special cycles.

Andries E. Brouwer, Pierre Duchet, Alexander Schrijver

Discret. Math., 1983

1981

A note on kernel-critical graphs.

Pierre Duchet, Henry Meyniel

Discret. Math., 1981

1979

Helly Families of Maximal Size.

Béla Bollobás, Pierre Duchet

J. Comb. Theory, Ser. A, 1979

1974

Sur les hypergraphes invariants.

Pierre Duchet

Discret. Math., 1974