default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenise Amar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j21]Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz:
A degree condition implying that every matching is contained in a hamiltonian cycle. Discret. Math. 309(11): 3703-3713 (2009)- 2007
- [j20]Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda:
Bipartite graphs with every matching in a cycle. Discret. Math. 307(11-12): 1525-1537 (2007) - 2005
- [j19]Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz:
Hamiltonian cycles and paths through matchings. Electron. Notes Discret. Math. 22: 543-547 (2005) - 2001
- [j18]Denise Amar, André Raspaud, Olivier Togni:
All-to-all wavelength-routing in all-optical compound networks. Discret. Math. 235(1-3): 353-363 (2001) - [j17]Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Denise Amar:
Cyclability and pancyclability in bipartite graphs. Discret. Math. 236(1-3): 3-11 (2001)
1990 – 1999
- 1998
- [j16]Denise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz:
Neighborhood conditions for balanced independent sets in bipartite graphs. Discret. Math. 181(1-3): 31-36 (1998) - [j15]Denise Amar, Olivier Togni:
Irregularity strength of trees. Discret. Math. 190(1-3): 15-38 (1998) - 1996
- [j14]Oscar Ordaz, Denise Amar, André Raspaud:
Hamiltonian properties and the bipartite independence number. Discret. Math. 161(1-3): 207-215 (1996) - 1995
- [j13]Denise Amar, Odile Favaron, Pedro Mago, Oscar Ordaz:
Biclosure and bistability in a balanced bipartite graph. J. Graph Theory 20(4): 513-529 (1995) - 1993
- [j12]Denise Amar:
Applying a condition for a hamiltonian bipartite graph to be bipancyclic. Discret. Math. 111(1-3): 19-25 (1993) - [j11]Denise Amar:
Irregularity strength of regular graphs of large degree. Discret. Math. 114(1-3): 9-17 (1993) - 1992
- [j10]Denise Amar:
A condition for a hamiltonian bipartite graph to be bipancyclic. Discret. Math. 102(3): 221-227 (1992) - [j9]Yannis Manoussakis, Denise Amar:
Hamiltonian paths and cycles, number of arcs and independence number in digraphs. Discret. Math. 105(1-3): 157-172 (1992) - 1991
- [j8]Denise Amar, André Raspaud:
Covering the vertices of a digraph by cycles of prescribed length. Discret. Math. 87(2): 111-118 (1991) - [j7]Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa:
Pancyclism in hamiltonian graphs. Discret. Math. 89(2): 111-131 (1991) - [j6]Denise Amar, Irène Fournier, Anne Germa:
Pancyclism in Chvátal-Erdös's graphs. Graphs Comb. 7(2): 101-112 (1991) - 1990
- [j5]Denise Amar, Yannis Manoussakis:
Cycles and paths of many lengths in bipartite digraphs. J. Comb. Theory B 50(2): 254-264 (1990)
1980 – 1989
- 1989
- [j4]Denise Amar, Irène Fournier, Anne Germa:
Covering the vertices of a graph by cycles of prescribed length. J. Graph Theory 13(3): 323-330 (1989) - 1986
- [j3]Denise Amar:
Partition of a bipartite hamiltonian graph into two cycles. Discret. Math. 58(1): 1-10 (1986) - 1983
- [j2]Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa:
Hamiltonian pancyclic graphs. Discret. Math. 46(3): 327 (1983) - [j1]Denise Amar:
On the Connectivity of Some Telecommunications Networks. IEEE Trans. Computers 32(5): 512-519 (1983)
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:22 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:
