Minimum degree and minimum number of edge-disjoint trees. Discrete Math. 275 (2004), no. 1-3, 195--205.
with A. Lladó
https://mat.upc.edu/en/people/susana.clara.lopez/publications/minimum-degree.pdf/view
https://mat.upc.edu/++resource++plone-logo.svg
Minimum degree and minimum number of edge-disjoint trees. Discrete Math. 275 (2004), no. 1-3, 195--205.
with A. Lladó
application/pdf
application/pdf
Susana Clara López Masip
New Springer Briefs
Publications
(Di)graph products, labelings and related results. 9th International Workshop on Graph Labelings (IWOGL 2016), 55--60, Electron. Notes Discrete Math., 60, Elsevier Sci. B. V., Amsterdam, 2017.
Perfect (super) edge-magic crowns. Results Math. 71 (2017), no. 3-4, 1459--1471.
A new labeling construction from the $\otimes_h$-product. Discrete Math. 340 (2017), no. 8, 1903--1909.
Distance labelings: a generalization of Langford sequences. Ars Math. Contemp. 12 (2017), no. 2, 235--245.
Rainbow eulerian multidigraphs and the product of cycles. Discrete Math. Theor. Comput. Sci. 17 (2016), no. 3, 91--104.
Langford sequences and a product of digraphs. European J. Combin. 53 (2016), 86--95.
Enumerating super edge-magic labelings for some types of path-like trees. Util. Math. 96 (2015), 285--299.
Connectivity and other invariants of generalized products of graphs. Acta Math. Hungar. 145 (2015), no. 2, 283--303.
A new application of the $\otimes_h$-product to $\alpha$-labelings. Discrete Math. 338 (2015), no. 6, 839--843.
Magic coverings and the Kronecker product. Util. Math. 95 (2014), 73--84.
Perfect edge-magic graphs. Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 57(105) (2014), no. 1, 81--91.
The jumping knight and other (super) edge-magic constructions. Mediterr. J. Math. 11 (2014), no. 2, 217--235.
A problem on edge-magic labelings of cycles. Canad. Math. Bull. 57 (2014), no. 2, 375--380.
Labeling constructions using digraph products. Discrete Appl. Math. 161 (2013), no. 18, 3005--3016.
New problems related to the valences of (super) edge-magic labelings. AKCE Int. J. Graphs Comb. 10 (2013), no. 2, 169--181.
Large restricted sumsets in general Abelian groups. European J. Combin. 34 (2013), no. 8, 1348--1364.
Small cutsets in arc-transitive digraphs of prime degree. Discrete Appl. Math. 161 (2013), no. 10-11, 1639--1645.
On vosperian and superconnected vertex-transitive digraphs. Graphs Combin. 29 (2013), no. 2, 241--251.
Perfect super edge-magic graphs. Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 55(103) (2012), no. 2, 199--208.
Open problems involving super edge-magic labelings and related topics. Bull. Inst. Combin. Appl. 65 (2012), 43--56.
On super edge-magic decomposable graphs. Indian J. Pure Appl. Math. 43 (2012), no. 5, 455--473.
The power of digraph products applied to labelings. Discrete Math. 312 (2012), no. 2, 221--228.
Super edge-magic models. Math. Comput. Sci. 5 (2011), no. 1, 63--68.
Enumerating super edge-magic labelings for the union of nonisomorphic graphs. Bull. Aust. Math. Soc. 84 (2011), no. 2, 310--321.
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. J. Graph Theory 67 (2011), no. 2, 124--138.
Bi-magic and other generalizations of super edge-magic labelings. Bull. Aust. Math. Soc. 84 (2011), no. 1, 137--152.
Every tree is a large subtree of a tree that decomposes $K_n$ and $K_{n,n}$. Discrete Math. 310 (2010), no. 4, 838--842.
Cyclic decompositions of $K_n$ and $K_{n,n}$ by a tree with a given large subtree. Sixth Conference on Discrete Mathematics and Computer Science (Spanish), 425--430, Univ. Lleida, Lleida, 2008.
Minimum tree decompositions with a given tree as a factor. Australas. J. Combin. 31 (2005), 47--59.
Edge-decompositions of $K_{n,n}$ into isomorphic copies of a given tree. J. Graph Theory 48 (2005), no. 1, 1--18.
Minimum degree and minimum number of edge-disjoint trees. Discrete Math. 275 (2004), no. 1-3, 195--205.
Higher edge-connectivities and tree decompositions in regular graphs. Discrete Math. 214 (2000), no. 1-3, 245--250.
Preprints
Teaching materials
Just read and see what happens!!!
Ready to use
Share: