Buscar
Mostrando ítems 1-2 de 2
On the (k, i)-coloring of cacti and complete graphs
(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 (k,i)-coloring of cacti and complete graphs
(Charles Babbage Res Ctr, 2018-01)
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 ...