moteur de recherche

Séminaire Algo - Mario Valencia-Pabon
Séminaire Algo - Mario Valencia-Pabon
28-mars-2017 14:30
Il y a: 259 days





Mario Valencia-Pabon

k-tuple colorings and hom-idempotence of graphs

Salle de séminaire (4B05R) - Bâtiment Copernic

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. A graph G is said to be hom-idempotent if there is a homomorphism from G\Box G to G, where G\Box G denotes the cartesian product graph of two copies of G. In this talk, I will show some recent results on k-tuple coloring of graphs. In particular, I will discuss the relationships between k-tuple coloring of the cartesian product of graphs and the concept of hom-idempotence of graphs.








<- retour: