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 Peter Horák
      Graph Theory as an Integral Part of Mathematics
10:00 - 10:30 coffee break
  Section 1531 Section 1796
10:30 - 10:50 Mirko Horňák
Decomposition of bipartite graphs into closed trails
Martin Mačaj
Decomposition of regular t-balanced Cayley maps from cyclic groups
10:55 - 11:15 Sylwia Cichacz
The open trails in digraphs
Róbert Hajduk
On the azulenoids with large ring of 5-gons
11:20 - 11:40 Agnieszka Görlich
Embedding of graph into its complement in transitive tournament
Pavol Hell
List homomorphisms for digraphs
12:00 - 13:30 lunch
  Section Beethoven Section Liszt
14:00 - 14:20 Alexander Rosa
Equitable specialized block-colourings of Steiner triple systems
Roman Kužel
A Closure Concept in K1,r-free Graphs
14:25 - 14:45 Tomáš Vetrík
Choosability of complete multipartite graphs
Peter Czimmermann
The (k,n-k)-reconstruction of graphs and digraphs
14:50 - 15:10 Kristína Budajová
The distinguishing colouring
Ruslan Gumerov
Contractible subgraphs and forbidden induced subgraphs
15:15 - 15:35 Katarína Horváthová
Complexity of approximation for 3-edge-coloring of cubic graphs
Zdeněk Ryjáček
Forbidden Subgraphs that Imply 2-Factors
15:35 - 16:00 coffee break
  Section Paganini - Bílý Zámek
16:00 - 16:30 Olga Procházková - sopran,   František Šmíd - keyboards
16:30 - 17:30 Mariusz Woźniak
      On 1, 2 Conjecture
17:30 - 18:00 Problem Session
18:00 - dinner

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