Browsing by Author "ef93e7c3-5b7c-4d1d-b83d-1b2384322930"

Now showing items 1-3 of 3

    • Clique coloring B1-EPG graphs 
      Bonomo, Flavia; Mazzoleni, María Pía; Stein, Maya (Elsevier, 2017)
      We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In ...
    • 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 ...
    • On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid 
      Alcón, Liliana; Bonomo, Flavia; Durán, Guillermo; Gutierrez, Marisa; Mazzoleni, María; Ries, Bernard; Valencia-Pabon, Mario (Elsevier B.V., 2018)
      Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a ...