k-tuple chromatic number of the cartesian product of graphs

A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest t so that there is a k-tuple coloring of G using t colors. It is well known t...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Koch, I., Torres, P., Valencia-Pabon, M.
Formato: JOUR
Materias:
Cartesian product of graphs
Cayley graphs
Hom-idempotent graphs
k-tuple colorings
Kneser graphs
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15710653_v50_n_p243_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares