default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoël Puech
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j14]Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech:
Irredundance and domination in kings graphs. Discret. Math. 262(1-3): 131-147 (2003)- 2002
- [j13]Dominique Barth, Olivier Baudon, Joël Puech:
Decomposable trees: a polynomial algorithm fortripodes. Discret. Appl. Math. 119(3): 205-216 (2002) - 2001
- [j12]Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech:
Generalised Ramsey Numbers with respect to Classes of Graphs. Ars Comb. 59 (2001) - [j11]Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt
, Joël Puech:
Ramsey properties of generalised irredundant sets in graphs. Discret. Math. 231(1-3): 123-134 (2001) - [j10]Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach:
On domination and annihilation in graphs with claw-free blocks. Discret. Math. 231(1-3): 143-151 (2001) - 2000
- [j9]Joël Puech:
R-annihilated and independent perfect neighborhood sets in chordal graphs. Discret. Math. 215: 181-199 (2000) - [j8]Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech:
Total domination in graphs with minimum degree three. J. Graph Theory 34(1): 9-19 (2000) - [j7]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech:
A characterization of (γ, i)-trees. J. Graph Theory 34(4): 277-292 (2000)
1990 – 1999
- 1999
- [j6]Joël Puech:
Stability, domination, and irredundance in WAR graphs. Ars Comb. 52 (1999) - [j5]Odile Favaron, Joël Puech:
Irredundant and perfect neighborhood sets in graphs and claw-free graphs. Discret. Math. 197-198: 269-284 (1999) - 1998
- [j4]Ernest J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt:
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs. Australas. J Comb. 18: 253-262 (1998) - [j3]Odile Favaron, Joël Puech:
Irredundance in grids. Discret. Math. 179(1-3): 257-265 (1998) - [j2]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech:
An inequality chain of domination parameters for trees. Discuss. Math. Graph Theory 18(1): 127-142 (1998) - [j1]Joël Puech:
Irredundance perfect and P6-free graphs. J. Graph Theory 29(4): 239-255 (1998)
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-04-25 05:58 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:
