Modulbeschreibung

Lecturer: Marc Hellmuth

Previous Knowledge: Familiarity with discrete mathematics, algorithmics and optimization

Certificate Requirements: Active participation in seminar + talk (+ written summary)

03.04.2019 | 10.04.2019 | 17.04.2019 | 24.04.2019 | 08.05.2019 | 15.05.2019 | 22.05.2019 | 29.05.2019 | 05.06.2019 | 12.06.2019 | 19.06.2019 | 26.06.2019 | 03.07.2019 | 10.07.2019 |

Seminar starts on Wednesday 03.04.2019 at 12.15pm - Rathenaustr. 47 - R. 5-08

Latest 1 week before your talk, come to my office in order to show me your slides or presentation-proposal!

This seminar is based on the "Handbook of Product Graphs".

1. Chp 4: Graph Products - Properties, Projections, Layers, Classification
2. Chp 5: The Four Standart Products - Cartesian, direct, strong and lexicogr. Product
    
3. Chp 6.1/5: Cartesian Product - Unique Prime Factor Decomposition and S-prime Graphs
4. Chp 23.1/2  (+11.1, 13.1/2): Cartesian Product - Prime Factor Decomposition Algorithm
    
5. Chp 24.2/3, 8.3 (+7.1. 8.7) Thin Strong Products - Prime Factor Decomposition Algorithm via Cartesian skeleton
6. Chp 33: Near Products - Graph Bundles, Approximate Products, Graph Spectra and Zig-Zag Product
    
7. Chp 10.1/3/4 + 24.5 Lexicographic Product
8. Chp 26.1/2/4: Coloring and Hedetniemi’s Conjecture
9.  
10. [ ... ]

In case there are questions (content, length of content etc.pp) write me an email!

"Handbook of Product Graphs, Second Edition (Discrete Mathematics and Its Applications)", Richard Hammack, Wilfried Imrich and Sandi Klavzar, CRC Press, 2011
"Topics in graph theory: Graphs and their Cartesian product.", Richard Hammack, Wilfried Imrich, Sandi Klavzar and Douglas F. Rall, CRC Press, 2008