340 likes | 451 Views
Tight product and semi-coloring of graphs. Masaru Kamada Tokyo University of Science Graph Theory Conference i n honor of Yoshimi Egawa on the occasion his 60 th birthday September 10-14, 2013. In this talk, all graphs are finite, undirected and allowed multiple edges without loops.
E N D
Tight product and semi-coloring of graphs Masaru Kamada Tokyo University of Science Graph Theory Conference in honor of Yoshimi Egawa on the occasion his 60th birthday September 10-14, 2013
In this talk, all graphs are finite, undirected and allowed multiple edges without loops. Multiple edges No loops
Example 25
Example 26
Example Class-1 Class-2 2 5 4 1 1 3 2 4 5 1 3 3 3 1 2 2