Now showing items 1-3 of 3

    • 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 ...
    • Neighbor-locating colorings in graphs 

      Alcón, Liliana; Gutierrez, Marisa; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2020-02-02)
      Article
      Open Access
      A k-coloring of a graph G is a k-partition of into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices belonging to the same color , the set of colors of the neighborhood ...
    • 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 ...