1 / 34

Tight product and semi-coloring of graphs

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.

traci
Télécharger la présentation

Tight product and semi-coloring of graphs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

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

  3. Example

  4. The main result

  5. Almost regular graph

  6. Outline of proof of Lemma 2

  7. Outline of proof of Lemma 3

  8. Example of case II

  9. Example of subcase II-ii

  10. Tight product

  11. Example 25

  12. Example 26

  13. The existence of the tight product(1)

  14. The existence of the tight product (2)

  15. Thank you for your attention

  16. Proper-edge-coloring

  17. Classification of simple graphs

  18. Example Class-1 Class-2 2 5 4 1 1 3 2 4 5 1 3 3 3 1 2 2

More Related