1 / 34

# Tight product and semi-coloring of graphs - PowerPoint PPT Presentation

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.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Tight product and semi-coloring of graphs' - traci

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Tight product and semi-coloring of graphs

Tokyo University of Science

Graph Theory Conference

in honor of Yoshimi Egawa on the occasion his 60th birthday

September 10-14, 2013

Multiple edges

No loops

Example multiple edges without loops.

The m multiple edges without loops.ain result

A multiple edges without loops.lmost regular graph

O multiple edges without loops.utline of proof of Lemma 2

Outline of proof of Lemma 3 multiple edges without loops.

Example of case II multiple edges without loops.

Example of subcase II-ii multiple edges without loops.

Tight product multiple edges without loops.

Example multiple edges without loops.

25

Example multiple edges without loops.

26

The existence of the tight product multiple edges without loops.(1)

The existence of the tight product (2) multiple edges without loops.

Thank you for your attention multiple edges without loops.

P multiple edges without loops.roper-edge-coloring

Classification of simple graphs multiple edges without loops.

Example multiple edges without loops.

Class-1

Class-2

2

5

4

1

1

3

2

4

5

1

3

3

3

1

2

2