Program

The conference consists of invited lectures as well as contributed 20-minute talks. The conference languages are English, Czech and Slovak.

Monday
June 11
Tuesday
June 12
Wednesday
June 13
Thursday
June 14
Friday
June 15
8:00 - 9:00 breakfast
9:00 - 10:00 Jiří Fiala
      Homomorphisms with local constraints - structure and complexity
10:00 - 10:30 coffee break
  Section Bílá Section Červená
10:30 - 10:50 Pavel Híc
New Results on Integral Graphs
Martin Pergel
On the recognition of PC-graphs with high girth
10:55 - 11:15 Tomáš Kupka
The spectral properties of the Cartesian product
Eva Jelínková
Three NP-Complete Problems in Seidel's Switching
11:20 - 11:40 Pavla Kabelíková
Practical use of Fiedler vector to graph partitioning
Jakub Teska
Toughness treshold for the existence of 2-walks in K4-minor free graphs
12:00 - 13:30 lunch
14:00 -           departure

PDF: program_csgt2007.pdf     PostScript: program_csgt2007.ps
Abstracts: abstracts_csgt2007.pdf

 

Equipment

There will be both an overhead and a data projector available along with one laptop or PC. The participants can use their own laptops. We encourage everybody to test the compatibility of the equipment ahead.

 


contact Last update: 29.12.2011