activity
20102022
most citedLangford sequences and a product of digraphs

6 citations · 8 across the 8 of their papers we have counts for

collaborators

9 papers

math.CO2022

Recent studies on the super edge-magic deficiency of graphs

Rikio Ichishima, S. C. López, Francesc A. Muntaner-Batle +1

A graph is called edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right) \right\ve…

math.CO2018

(Di)graph decompositions and magic type labelings: a dual relation

S. C. López, F. A. Muntaner-Batle, M. Prabu

A graph is called edge-magic if there is a bijective function from the set of vertices and edges to the set such that the sum $f(x)+f(xy)+f(y…

math.CO2017

New constructions for the -queens problem

Martin Bača, Susana-Clara López, Francesc-Antoni Muntaner-Batle +1

Let be a digraph, possibly with loops. A queen labeling of is a bijective function such that, for every pair of arcs in …

math.CO2015

Distance labelings: a generalization of Langford sequences

S. C. López, F. A. Muntaner-Batle

A Langford sequence of order and defect can be identified with a labeling of the vertices of a path of order in which each labeled from up to appears twice…

math.CO2014★ 6 cited

Langford sequences and a product of digraphs

Susana-Clara López, Francesc-Antoni Muntaner-Batle

Skolem and Langford sequences and their many generalizations have applications in numerous areas. The -product is a generalization of the direct product of digraphs. In…

math.CO2014★ 1 cited

Rainbow eulerian multidigraphs and the product of cycles

Susana-Clara López, Francesc-Antoni Muntaner-Batle

An arc colored eulerian multidigraph with colors is rainbow eulerian if there is an eulerian circuit in which a sequence of colors repeats. The digraph product that refers…