Modulbeschreibung

Lecturer: Marc Hellmuth

Previous Knowledge: Familiarity with discrete mathematics, algorithmics and optimization

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

Seminar starts on Tuesday 5. April at 4.15pm - Franz-Mehring-Straße 47/48 - SR 5

Auf Wunsch der Studierenden wird das Seminar auf 15:45 Uhr verlegt.

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

Seminar on June 14th starts 4.15pm

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

1. Chp 4 by KM (03-May): Graph Products - Properties, Projections, Layers, Classification [SLIDES]
2. Chp 5 by SB (10-May): The Four Standart Products - Cartesian, direct, strong and lexicogr. Product [SLIDES]
3. Chp 6.1/5 by KW (7-June): Cartesian Product - Unique Prime Factor Decomposition and S-prime Graphs [SLIDES]
4. Chp 23.1/2  (+11.1, 13.1/2) by PK (14-June): Cartesian Product - Prime Factor Decomposition Algorithm [SLIDES]
5. Chp 26.1/2/4 BW (21-June): Coloring and Hedetniemi’s Conjecture [SLIDES]
6. Chp 33 by RS (5-July): Near Products - Graph Bundles, Approximate Products, Graph Spectra and Zig-Zag Product [SLIDES]

Further open topics for talks:

Chp 24.2/3, 8.3 (+7.1. 8.7) Thin Strong Products - Prime Factor Decomposition Algorithm via Cartesian skeleton
Chp 10.1/3/4 + 24.5 Lexicographic Product

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