9th SEG Workshop "Combinatorics, Graph Theory and Algorithms"

Information (e.g. on past and coming events) on the regularly held workshop "Combinatorics, Graph Theory and Algorithms" can be found here.

On June, 28th 2011, the 9th SEG workshop "Combinatorics, Graph Theory and Algorithms" will be held at the chair of Theoretical Computer Science and Information Security.

The following talks will be held (schedule in PDF format):
 

1^st: Dipl.-Math. Martin Trinks (Hochschule Mittweida)
"From spanning forests to edge subsets"
Tuesday, June 28th 2011, 3.00 - 3.30 pm, room 1/219
 

2^nd: Prof. Dr. Ingo Schiermeyer (TU Bergakademie Freiberg)
"On minimally rainbow k-connected graphs"
Tuesday, June 28th 2011, 3.30 - 4.00 pm, room 1/219
 

3^rd: Dipl.-Math. Knut Odermann (TU Chemnitz)
"Netzwerkflussspanner"
Tuesday, June 28th 2011, 4.45 - 5.15 pm, room 1/219
 

4^th: Carol T. Zamfirescu (TU Dortmund)
"Planar hypohamiltonian graphs"
Tuesday, June 28th 2011, 5.15 - 5.45 pm, room 1/219
 

5^th: Prof. Dr. Ivan Veselic (TU Chemnitz)
"Geometrische Eigenschaften von Perkolationsclustern auf Cayleygraphen"
Tuesday, june 28th 2011, 5.45 - 6.15 pm, room 1/219