Susana-Clara López

Orcid: 0000-0003-2438-913X

Affiliations:
  • Polytechnic University of Catalonia, Castelldefels, Spain


According to our database1, Susana-Clara López authored at least 20 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
On total <i>H</i>-irregularity strength of the disjoint union of graphs.
Discuss. Math. Graph Theory, 2020

2018
On the beta-number of forests with isomorphic components.
Discuss. Math. Graph Theory, 2018

2017
(Di)graph products, labelings and related results.
Electron. Notes Discret. Math., 2017

A new labeling construction from the ⊗<sub>h</sub>-product.
Discret. Math., 2017

Distance labelings: a generalization of Langford sequences.
Ars Math. Contemp., 2017

2016
Langford sequences and a product of digraphs.
Eur. J. Comb., 2016

Rainbow eulerian multidigraphs and the product of cycles.
Discret. Math. Theor. Comput. Sci., 2016

2015
A new application of the ⊗h-product to α-labelings.
Discret. Math., 2015

2013
On Vosperian and Superconnected Vertex-Transitive Digraphs.
Graphs Comb., 2013

Large restricted sumsets in general Abelian groups.
Eur. J. Comb., 2013

Labeling constructions using digraph products.
Discret. Appl. Math., 2013

Small cutsets in arc-transitive digraphs of prime degree.
Discret. Appl. Math., 2013

2012
The power of digraph products applied to labelings.
Discret. Math., 2012

2011
Super Edge-Magic Models.
Math. Comput. Sci., 2011

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors.
J. Graph Theory, 2011

2010
Every tree is a large subtree of a tree that decomposes K<sub>n</sub> or K<sub>n, n</sub>.
Discret. Math., 2010

2005
Edge-decompositions of <i>Kn, <sub>n</sub></i> into isomorphic copies of a given tree.
J. Graph Theory, 2005

Minimum tree decompositions with a given tree as a factor.
Australas. J Comb., 2005

2004
Minimum degree and minimum number of edge-disjoint trees.
Discret. Math., 2004

2000
Higher edge-connectivities and tree decompositions in regular graphs.
Discret. Math., 2000


  Loading...