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 60 th birthday September 10-14, 2013

In this talk, all graphs are finite, undirected and allowed multiple edges without loops. No loops Multiple edges

Example

The main result

Almost regular graph

Outline of proof of Lemma 2

Outline of proof of Lemma 3

Example of case II

Example of subcase II-ii

Tight product

Example 25

Example 26

The existence of the tight product (1)

The existence of the tight product (2)

Thank you for your attention

Proper-edge-coloring

Classification of simple graphs

Example Class-1Class