Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Caroline Reis Patrão"'
Publikováno v:
Journal of Combinatorial Optimization. 44:119-135
In this work, we investigate the total and edge colorings of the Kneser graphs K(n, s). We prove that the sparse case of Kneser graphs, the odd graphs $$O_k=K(2k-1,k-1)$$ , have total chromatic number equal to $$\Delta (O_k) + 1$$ . We prove that Kne
Autor:
Diane Castonguay, Luis Antonio Brasil Kowada, A. C. Ribeiro, Caroline Reis Patrão, Celina M. H. de Figueiredo
Publikováno v:
Anais do Encontro de Teoria da Computação (ETC).
The family of graphs H,p has been defined in the context of edge partitions. The established properties such as vertex transitivity and low diameter suggest this family as a good topology for the design of interconnection networks. The vertices of th