default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSusana-Clara López
Person information
- affiliation: Polytechnic University of Catalonia, Castelldefels, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j20]Faraha Ashraf, Martin Baca, Susana-Clara López, Francesc Antoni Muntaner-Batle, Akito Oshima, Andrea Semanicová-Fenovcíková
:
On total H-irregularity strength of the disjoint union of graphs. Discuss. Math. Graph Theory 40(1): 181-194 (2020)
2010 – 2019
- 2018
- [j19]Rikio Ichishima, Susana-Clara López, Francesc Antoni Muntaner-Batle, Akito Oshima:
On the beta-number of forests with isomorphic components. Discuss. Math. Graph Theory 38(3): 683-701 (2018) - 2017
- [j18]Susana-Clara López, Francesc Antoni Muntaner-Batle:
Distance labelings: a generalization of Langford sequences. Ars Math. Contemp. 12(2): 235-245 (2017) - [j17]Susana-Clara López, Francesc A. Muntaner-Batle, M. Prabu:
A new labeling construction from the ⊗h-product. Discret. Math. 340(8): 1903-1909 (2017) - [j16]Susana-Clara López:
(Di)graph products, labelings and related results. Electron. Notes Discret. Math. 60: 55-60 (2017) - 2016
- [j15]Susana-Clara López, Francesc Antoni Muntaner-Batle:
Rainbow eulerian multidigraphs and the product of cycles. Discret. Math. Theor. Comput. Sci. 17(3): 90-104 (2016) - [j14]Susana-Clara López, Francesc A. Muntaner-Batle:
Langford sequences and a product of digraphs. Eur. J. Comb. 53: 86-95 (2016) - 2015
- [j13]Susana-Clara López, Francesc A. Muntaner-Batle:
A new application of the ⊗h-product to α-labelings. Discret. Math. 338(6): 839-843 (2015) - 2013
- [j12]Susana-Clara López:
Small cutsets in arc-transitive digraphs of prime degree. Discret. Appl. Math. 161(10-11): 1639-1645 (2013) - [j11]Susana-Clara López, Francesc A. Muntaner-Batle, Miquel Rius-Font:
Labeling constructions using digraph products. Discret. Appl. Math. 161(18): 3005-3016 (2013) - [j10]Yahya Ould Hamidoune, Susana-Clara López, Alain Plagne:
Large restricted sumsets in general Abelian groups. Eur. J. Comb. 34(8): 1348-1364 (2013) - [j9]Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
On Vosperian and Superconnected Vertex-Transitive Digraphs. Graphs Comb. 29(2): 241-251 (2013) - 2012
- [j8]Rikio Ichishima, Susana-Clara López, Francesc A. Muntaner-Batle, Miquel Rius-Font:
The power of digraph products applied to labelings. Discret. Math. 312(2): 221-228 (2012) - 2011
- [j7]Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. J. Graph Theory 67(2): 124-138 (2011) - [j6]Susana-Clara López, Francesc A. Muntaner-Batle, Miquel Rius-Font:
Super Edge-Magic Models. Math. Comput. Sci. 5(1): 63-68 (2011) - 2010
- [j5]Anna S. Lladó, Susana-Clara López, Jordi Moragas:
Every tree is a large subtree of a tree that decomposes Kn or Kn, n. Discret. Math. 310(4): 838-842 (2010)
2000 – 2009
- 2005
- [j4]Anna Lladó, Susana-Clara López Masip:
Minimum tree decompositions with a given tree as a factor. Australas. J Comb. 31: 47-60 (2005) - [j3]Anna S. Lladó, Susana-Clara López:
Edge-decompositions of Kn, n into isomorphic copies of a given tree. J. Graph Theory 48(1): 1-18 (2005) - 2004
- [j2]Anna M. Lladó Sanchez, Susana-Clara López Masip:
Minimum degree and minimum number of edge-disjoint trees. Discret. Math. 275(1-3): 195-205 (2004) - 2000
- [j1]Amauri Gutiérrez, Anna S. Lladó, Susana-Clara López:
Higher edge-connectivities and tree decompositions in regular graphs. Discret. Math. 214(1-3): 245-250 (2000)
Coauthor Index
aka: Francesc Antoni Muntaner-Batle
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:51 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:
