Pierre Duchet

发表

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

Henry Meyniel, Pierre Duchet, P. Duchet, 1983, Eur. J. Comb..

Sur les quasi-noyaux d'un graphe

Yahya Ould Hamidoune, Henry Meyniel, Pierre Duchet, 1987, Discret. Math..

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

Henry Meyniel, Michel Las Vergnas, Pierre Duchet, 1986, Discret. Math..

On the orientation of meyniel graphs

Frédéric Maffray, Mostafa Blidia, Pierre Duchet, 1994, J. Graph Theory.

A note on kernel-critical graphs

Henry Meyniel, Pierre Duchet, H. Meyniel, 1981, Discret. Math..

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

Raul Cordovil, Pierre Duchet, 1986, Discret. Math..

Kernels in directed graphs: a poison game

Henry Meyniel, Pierre Duchet, H. Meyniel, 1993, Discret. Math..

Representing a planar graph by vertical lines joining different levels

Yahya Ould Hamidoune, Henry Meyniel, Michel Las Vergnas, 1983, Discret. Math..

Graphs whose neighborhoods have no special cycles

Alexander Schrijver, Andries E. Brouwer, Pierre Duchet, 1983, Discrete Mathematics.

On kernels in perfect graphs

Frédéric Maffray, Mostafa Blidia, Pierre Duchet, 1993, Comb..

A sufficient condition for a digraph to be kernel-perfect

Pierre Duchet, P. Duchet, 1987, J. Graph Theory.

On Helly families of maximal size

Béla Bollobás, Pierre Duchet, 1983, J. Comb. Theory, Ser. B.

Generating Guided Tours over Indexed Information Resources

Benjamin Buffereau, Philippe Picouet, Pierre Duchet, 2003, ICWI.

Generating guided tours to facilitate learning from a set of indexed resources

Benjamin Buffereau, Philippe Picouet, Pierre Duchet, 2003, Proceedings 3rd IEEE International Conference on Advanced Technologies.

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

Stefan Janaqi, Pierre Duchet, 2000, Ars Comb..

Recent problems and results about kernels in directed graphs

Claude Berge, Pierre Duchet, C. Berge, 1991, Discret. Math..

Convex sets in graphs, II. Minimal path convexity

Pierre Duchet, P. Duchet, 1987, J. Comb. Theory B.

Cyclic Polytopes and Oriented Matroids

Raul Cordovil, Pierre Duchet, P. Duchet, 2000, Eur. J. Comb..

Some operations preserving the existence of kernels

Frédéric Maffray, Mostafa Blidia, Henry Meyniel, 1999, Discret. Math..

On locally-perfect colorings

Pierre Duchet, P. Duchet, 1989, Discret. Math..

Sur les hypergraphes invariants

Pierre Duchet, 1974, Discret. Math..

More characterizations of triangulated graphs

Peter L. Hammer, Yves Crama, Frédéric Maffray, 1990, J. Graph Theory.

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

Henry Meyniel, Pierre Duchet, P. Duchet, 1983, Discret. Math..

Sur la contractibilité d'un graphe orienté en K*4

Pierre Duchet, Viktor Kaneti, P. Duchet, 1994, Discrete Mathematics.

Graphes parfaitement ordonnables généralises

Stephan Olariu, Pierre Duchet, 1991, Discret. Math..

Helly Families of Maximal Size

Béla Bollobás, Pierre Duchet, B. Bollobás, 1979, J. Comb. Theory, Ser. A.

Parity graphs are kernel-M-solvable

Pierre Duchet, P. Duchet, 1987, J. Comb. Theory, Ser. B.

Sur la contraction des graphes orientes en K*3

Pierre Duchet, Viktor Kaneti, 1987, Discret. Math..

Generalized perfectly orderable graphs

Stephan Olariu, Pierre Duchet, S. Olariu, 1991 .

On the contractability of an acute oriented graph in K

Pierre Duchet, P. Duchet, Viktor Kaneti, 1994 .

Convexity in combinatorial structures

Pierre Duchet, 1987 .