CSGT 2007

Czech-Slovak

Graph Theory

Conference 2007

Welcome

Poster, announcements

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	Thursday June 14
8:00 - 9:00	breakfast
9:00 - 10:00	Mirka Miller Graphs of Order Close to Moore Bound: Overview and Open Problems
10:00 - 10:30	coffee break
	Section Záviš	Section 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	lunch
14:00 - 15:00	Roman Čada On packing in graphs
15:00 - 15:30	coffee break
	Section Kašpar	Section 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
	Section Hammerstein
19:00 -	conference 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