Recent Submissions

  • Total domination in plane triangulations 

    Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2020-11-09)
    Research report
    Open Access
  • Metric dimension of maximal outerplanar graphs 

    Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Hernández Peñalver, Gregorio; Garcia Olaverri, Alfredo Martin; Tejel, Javier (2019-03-28)
    Research report
    Open Access
  • Trees whose even-degree vertices induce a path are antimagic 

    Lozano Boixadors, Antoni; Mora Giné, Mercè; Seara Ojea, Carlos; Tey Carrera, Joaquín (2019-05-16)
    Research report
    Open Access
    An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels ...
  • The neighbor-locating-chromatic number of pseudotrees 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Gonzalez, Marisa; Alcón, Liliana (2019-03-28)
    Research report
    Open Access
    Ak-coloringof a graphGis a partition of the vertices ofGintokindependent sets,which are calledcolors. Ak-coloring isneighbor-locatingif any two vertices belongingto the same color can be distinguished from each other by ...
  • Neighbor-locating colorings in graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Alcón, Liliana; Gutierrez, Marisa (2018-06-29)
    Research report
    Open Access
    A k -coloring of a graph G is a k -partition ¿ = { S 1 ,...,S k } of V ( G ) into independent sets, called colors . A k -coloring is called neighbor-locating if for every pair of vertices u,v belonging to the same color S ...