• On the (k, i)-coloring of cacti and complete graphs 

      Bonomo, Flavia; Durán, Guillermo; Koch, Ivo; Valencia Pabon, Mario (Charles Babbage Institute, 2018)
      In the (k, i)-coloring problem, we aim to assign sets of colors of size k to the vertices of a graph G, so that the sets which belong to adjacent vertices of G intersect in no more than i elements and the total number of ...