default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-François Saclé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j15]Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Wozniak
:
A note on neighbor expanded sum distinguishing index. Discuss. Math. Graph Theory 37(1): 29-37 (2017)- 2013
- [j14]Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak:
Neighbor Sum Distinguishing Index. Graphs Comb. 29(5): 1329-1336 (2013) - 2012
- [j13]Maryvonne Mahéo, Jean-François Saclé:
SOME RESULTS ON (p, g, ∑)-VALUATION OF GRAPHS. Discret. Math. Algorithms Appl. 4(3) (2012)
2000 – 2009
- 2005
- [j12]Jozef Bucko, Peter Mihók, Jean-François Saclé, Mariusz Wozniak:
A note on maximal common subgraphs of the Dirac's family of graphs. Discuss. Math. Graph Theory 25(3): 385-390 (2005) - 2001
- [j11]Hamamache Kheddouci, Susan Marshall, Jean-François Saclé, Mariusz Wozniak:
On the packing of three graphs. Discret. Math. 236(1-3): 197-225 (2001) - 2000
- [j10]Hamamache Kheddouci, Jean-François Saclé, Mariusz Wozniak:
Packing two copies of a tree into its fourth power. Discret. Math. 213(1-3): 169-178 (2000)
1990 – 1999
- 1997
- [j9]Jean-François Saclé, Mariusz Wozniak:
A note on packing of three forests. Discret. Math. 164(1-3): 265-274 (1997) - [j8]Jean-François Saclé, Mariusz Wozniak:
On graphs which contain each tree of given size. Discret. Math. 165-166: 599-605 (1997) - [j7]Jean-François Saclé, Mariusz Wozniak:
The Erdös-Sós Conjecture for Graphs withoutC4. J. Comb. Theory B 70(2): 367-372 (1997) - 1996
- [j6]Jean-François Saclé:
Lower bounds for the size in four families of minimum broadcast graphs. Discret. Math. 150(1-3): 359-369 (1996) - [j5]Maryvonne Mahéo, Jean-François Saclé, Mariusz Wozniak:
Edge-disjoint Placement of Three Trees. Eur. J. Comb. 17(6): 543-563 (1996) - 1994
- [j4]Maryvonne Mahéo, Jean-François Saclé:
Some minimum broadcast graphs. Discret. Appl. Math. 53(1-3): 275-285 (1994) - [j3]Maryvonne Mahéo, Jean-François Saclé:
Note on the problem of gossiping in multidimensional grids. Discret. Appl. Math. 53(1-3): 287-290 (1994) - 1993
- [j2]Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
Some eigenvalue properties in graphs (conjectures of Graffiti - II). Discret. Math. 111(1-3): 197-220 (1993) - 1991
- [j1]Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
On the residue of a graph. J. Graph Theory 15(1): 39-64 (1991)
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:20 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:
