Susana-Clara López

Learn More
We study the Häggkvist conjecture which states that, for each tree T with n edges, there is an edge-partition of the complete bipartite graph Kn;n into n isomorphic copies of T . We use the concept of bigraceful labelings, introduced in [7], which give rise to cyclic decompositions of Kn;n. When a tree T of size n is not known to be bigraceful it is shown,(More)
INTRODUCTION In recent years, reports of attentional deficits in schizophrenic patients and in their biological relatives have rapidly increased, including an important effort to search for the endophenotypes in order to link specific genes to this illness. Posner et al. developed a test, the Attention Network Test (ANT), to study the neural networks. This(More)