default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Duchet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[c2]Benjamin Buffereau, Pierre Duchet, Philippe Picouet:
Generating Guided Tours over Indexed Information Resources. ICWI 2003: 1051-1056- [c1]Benjamin Buffereau, Pierre Duchet, Philippe Picouet:
Generating Guided Tours to Facilitate Learning from a Set of Indexed Resources. ICALT 2003: 492 - 2000
- [j27]Stefan Janaqi, Pierre Duchet:
Generator-Preserving contractions and a Min-Max result on the graphs of planar polyominoes. Ars Comb. 55 (2000) - [j26]Raul Cordovil, Pierre Duchet:
Cyclic Polytopes and Oriented Matroids. Eur. J. Comb. 21(1): 49-64 (2000)
1990 – 1999
- 1999
- [j25]Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel:
Some operations preserving the existence of kernels. Discret. Math. 205(1-3): 211-216 (1999) - 1994
- [j24]Pierre Duchet, Viktor Kaneti:
Sur la contractibilité d'un graphe orienté en K*4. Discret. Math. 130(1-3): 57-68 (1994) - [j23]Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On the orientation of meyniel graphs. J. Graph Theory 18(7): 705-711 (1994) - 1993
- [j22]Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On kernels in perfect graphs. Comb. 13(2): 231-233 (1993) - [j21]Pierre Duchet, Henry Meyniel:
Kernels in directed graphs: a poison game. Discret. Math. 115(1-3): 273-276 (1993) - 1991
- [j20]Pierre Duchet, Stephan Olariu:
Graphes parfaitement ordonnables généralises. Discret. Math. 90(1): 99-101 (1991) - 1990
- [j19]Raul Cordovil, Pierre Duchet:
On sign-invariance graphs of uniform oriented matroids. Discret. Math. 79(3): 251-257 (1990) - [j18]Claude Berge, Pierre Duchet:
Recent problems and results about kernels in directed graphs. Discret. Math. 86(1-3): 27-31 (1990) - [j17]Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray:
More characterizations of triangulated graphs. J. Graph Theory 14(4): 413-422 (1990)
1980 – 1989
- 1989
- [j16]Pierre Duchet:
On locally-perfect colorings. Discret. Math. 74(1-2): 29-32 (1989) - 1988
- [j15]Pierre Duchet:
Convex sets in graphs, II. Minimal path convexity. J. Comb. Theory B 44(3): 307-316 (1988) - 1987
- [j14]Pierre Duchet, Viktor Kaneti:
Sur la contraction des graphes orientes en K*3. Discret. Math. 65(1): 95-98 (1987) - [j13]Pierre Duchet, Yahya Ould Hamidoune, Henry Meyniel:
Sur les quasi-noyaux d'un graphe. Discret. Math. 65(3): 231-235 (1987) - [j12]Pierre Duchet:
Parity graphs are kernel-M-solvable. J. Comb. Theory B 43(2): 121-126 (1987) - [j11]Pierre Duchet:
A sufficient condition for a digraph to be kernel-perfect. J. Graph Theory 11(1): 81-85 (1987) - 1986
- [j10]Raul Cordovil, Pierre Duchet:
Separation par une droite dans les matroïdes orientes de rang 3. Discret. Math. 62(1): 103-104 (1986) - [j9]Pierre Duchet, Michel Las Vergnas, Henry Meyniel:
Connected cutsets of a graph and triangle bases of the cycle space. Discret. Math. 62(2): 145-154 (1986) - 1983
- [j8]Pierre Duchet, Henry Meyniel:
Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes. Discret. Math. 43(1): 21-27 (1983) - [j7]Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel:
Representing a planar graph by vertical lines joining different levels. Discret. Math. 46(3): 319-321 (1983) - [j6]Andries E. Brouwer, Pierre Duchet, Alexander Schrijver:
Graphs whose neighborhoods have no special cycles. Discret. Math. 47: 177-182 (1983) - [j5]Pierre Duchet, Henry Meyniel:
Ensemble Convexes dans les Graphes I: Théorèmes de Helly et de Radon pour Graphes et Surfaces. Eur. J. Comb. 4(2): 127-132 (1983) - [j4]Béla Bollobás, Pierre Duchet:
On Helly families of maximal size. J. Comb. Theory B 35(3): 290-296 (1983) - 1981
- [j3]Pierre Duchet, Henry Meyniel:
A note on kernel-critical graphs. Discret. Math. 33(1): 103-105 (1981)
1970 – 1979
- 1979
- [j2]Béla Bollobás, Pierre Duchet:
Helly Families of Maximal Size. J. Comb. Theory A 26(2): 197-200 (1979) - 1974
- [j1]Pierre Duchet:
Sur les hypergraphes invariants. Discret. Math. 8(3): 269-280 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
