Masaru Kamada Tokyo University of Science Graph Theory Conference i n honor of Yoshimi Egawa on the occasion his 60 th birthday September 1014 2013 In this talk all graphs are finite undirected and allowed multiple edges without loops ID: 423103
Download Presentation The PPT/PDF document "Tight product and semi-coloring of graph..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
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, 2013Slide2
In this talk, all graphs are finite, undirected and allowed multiple edges without loops.
No loops
Multiple edgesSlide3Slide4
Example
Slide5
The main resultSlide6
Almost regular graphSlide7Slide8
Outline of proof of Lemma 2Slide9Slide10Slide11Slide12
Outline of proof of Lemma 3Slide13Slide14Slide15Slide16Slide17
Example of case IISlide18
Example of subcase II-iiSlide19Slide20
Slide21
Slide22
Slide23Slide24
Tight productSlide25
Example
25Slide26
Example
26Slide27
The existence of the tight product
(1)Slide28Slide29
The existence of the tight product (2)Slide30Slide31
Thank you for your attentionSlide32
Proper-edge-coloringSlide33
Classification of simple graphsSlide34
Example
Class-1
Class-2
1
1
3
2
3
2
1
5
4
5
3
3
1
2
4
2