Dominique Sotteau

Learn More
We define the concepts of an injective colouring and the injective chromatic number of a graph and give some upper and lower bounds in general, plus some exact values. We explore in particular the injective chromatic number of the hypercube and put it in the context of previous work on similar concepts, especially the theory of errorcorrecting codes.(More)
Abstract Let G and H be two simple undirected graphs An embedding of the graph G into the graph H is an injective mapping f from the vertices of G to the vertices of H together with a mapping which assigns to each edge u v of G a path between f u and f v in H The grid M r s is the graph whose vertex set is the set of pairs on nonnegative integers f i j i r(More)