Program

Dopoledn� i odpoledn� blok konference za��n� pozvanou p�edn�kou. N�sleduj� 20ti minutov� p��sp�vky ��astn�k�. Konferen�n�m jazykem je angli�tina, �e�tina a sloven�tina.

Pond�l�
11. �ervna
�ter�
12. �ervna
St�eda
13. �ervna
�tvrtek
14. �ervna
P�tek
15. �ervna
8:00 - 9:00 sn�dan�
9:00 - 10:00 Mirka Miller
      Graphs of Order Close to Moore Bound: Overview and Open Problems
10:00 - 10:30 p�est�vka
  Sekce Z�vi� Sekce Kunhuta
10:30 - 10:50 Martin Ba�a
On super antimagic labelings of trees
Edita M��ajov�
Hypohamiltonian cubic graphs of girth 7
10:55 - 11:15 Andrea Semani�ov�
Superarithmetic graphs
Jan Ekstein
Hamiltonian Cycles in the Square of a Graph with Block Graph Homeomorphic to a Star
11:20 - 11:40 Jan Kratochv�l
Telledomination in chordal graphs
�tefan Gy�rki
Goal-minimally k-elongated graphs
12:00 - 13:30 ob�d
14:00 - 15:00 Roman �ada
      On packing in graphs
15:00 - 15:30 p�est�vka
  Sekce Ka�par Sekce Kry�tof
15:30 - 15:50 Pavel Hrn�iar
A new family of graceful trees
Martin Knor
Embeddings of tables of groups of order 8
15:55 - 16:15 Dalibor Fron�ek
Decomposing complete graphs into small rosy graphs
Vladim�r Vetch�
Square of metrically regular graphs
16:20 - 16:40 Michael Kubesa
Survey of methods for factorizations of complete graphs into spanning trees
Na�a Krivo��kov�
Reduction of matrices determining restrictions for counterexamples to 5-flow conjecture
16:45 - 17:05 Petr Kov��
On factorizations of complete graphs into spanning trees with at most four nonleave vertices
Robert Luko�ka
Real flow number and the cycle rank of a graph
  Sekce Hammerstein
19:00 - slavnostn� ve�e�e

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

 

Technick� vybaven�

Pro p�edn�ej�c� bude k dispozici dataprojektor, zp�tn� projektor a jeden laptop nebo PC. P�edn�ej�c� mohou pou��t vlastn� po��ta�, doporu�ujeme v�ak v p�edstihu vyzkou�et p�ipojen� k projektoru.

 


kontakt Posledn� �prava: 29.12.2011