CSGT | Graphs 2019

Programme

The conference starts on Monday 3 June 2019 with lunch and ends on Friday 7 June 2019 with lunch. The scientific programme of the conference will consist of lectures by invited speakers and contributed talks. Time limit for the contributed talks is 20 minutes. The conference languages are English, Slovak and Czech; it is recommended to accompany non-English talks with presentations written in English.

The abstracts of the talks will be available in the abstract booklet.

For lectures and talks, a data projector with a laptop (file formats that are acceptable for a presentation: .ppt, .pdf, .ps), a black/white-board or a flipchart will be available in the lecture room.

As usual, the conference programme includes a trip planned for Wednesday afternoon.

Day	Time	Programme
Monday 3 June 2019	10:00 - 12:30	Registration
	12:30 - 14:00	Lunch
	15:00 - 15:50	SHORT CYCLES IN PLANE GRAPHS Tomáš Madaras
	15:55 - 16:15	3-CHOOSABILITY OF PLANAR GRAPHS WITH MAXIMUM DEGREE 4 Mária Maceková
	16:20 - 16:45	Coffee break
	16:45 - 17:05	COLORINGS OF PLANE GRAPHS - SOME OPEN PROBLEMS Stanislav Jendroľ
	17:10 - 17:30	STRUCTURE OF EDGES OF EMBEDDED GRAPHS WITH MINIMUM DEGREE 2 Katarína Čekanová
	17:35 - 17:55	HAMILTONICITY OF 1-PLANAR GRAPHS Samuel Mohr
	18:00 - 18:20	FACIALLY PROPER COLORINGS OF PLANE GRAPHS WITH UNIQUE EXTREMAL COLORS Simona Rindošová
	19:00	Welcome party
Tuesday 4 June 2019	07:30 - 09:00	Breakfast
	09:00 - 09:50	EXTREMAL PROBLEMS CONCERNING TOURNAMENTS Daniel Kráľ
	09:55 - 10:15	ON METRIC DIMENSION OF CAYLEY DIGRAPHS OF METACYCLIC GROUPS Marcel Abas
	10:20 - 10:45	Coffee break
	10:45 - 11:05	AN UPPER BOUND FOR LARGE GRAPHS OF GIVEN DEGREE AND DIAMETER TWO ARISING FROM ABELIAN LIFTS OF COMPLETE BIPARTITE MULTIGRAPHS Pavol Jánoš
	11:10 - 11:30	CLASSIFICATION OF EDGE-TRANSITIVE MAPS AND GROUP ACTIONS ON ORIENTABLE SURFACES Ján Karabáš
	11:35 - 11:55	EDGE COLOURING PERMUTATION GRAPHS Tomáš Kaiser
	12:00 - 12:20	THE IMPACT OF EMIGRATION ON SLOVAK MATHEMATICS THE CASE OF THE BRATISLAVA GRAPH THEORY SEMINAR Milan Lekár
	12:30 - 14:00	Lunch
	15:00 - 15:50	X-MINORS AND X-SPANNING SUBGRAPHS Jochen Harant
	15:55 - 16:15	ON THE CLAR NUMBER OF BENZENOID GRAPHS István Estélyi
	16:20 - 16:45	Coffee break
	16:45 - 17:05	t-STRONG CLIQUES Michał Dębski
	17:10 - 17:30	GRAOVAC-PISANSKI INDEX FOR TREES Martin Knor
	17:35 - 17:55	UPPER BOUNDS ON THE ORDERS OF (k, g)-GRAPHS DERIVED FROM CONDITIONS ON THEIR SPECTRA Tom Raiman
	18:00 - 18:20	FINITELY FORCIBLE GRAPH LIMITS ARE UNIVERSAL Jacob Cooper
	18:30 - 20:00	Dinner
Wednesday 5 June 2019	07:30 - 09:00	Breakfast
	09:00 - 09:50	SMALLEST COUNTEREXAMPLE TO THE FULKERSON CONJECTURE MUST BE CYCLICALLY 5-EDGE CONNECTED Edita Máčajová
	09:55 - 10:15	SUPERPOSITION OF SNARKS REVISITED Martin Škoviera
	10:20 - 10:45	Coffee break
	10:45 - 11:05	PACKING OVALS INTO PROJECTIVE PLANES Martin Mačaj
	11:10 - 11:30	ON THE ACHROMATIC NUMBER OF THE CARTESIAN PRODUCT OF TWO COMPLETE GRAPHS Mirko Horňák
	11:35 - 11:55	STAR EDGE COLORING OF GRIDS Erika Vojtková
	12:00	Conference photo
	12:30 - 14:00	Lunch
	14:00	TRIP
	18:30 - 20:00	Dinner
Thursday 6 June 2019	07:30 - 09:00	Breakfast
	09:00 - 09:50	PLANAR GRAPHS HAVE BOUNDED QUEUE-NUMBER Piotr Micek
	09:55 - 10:15	TOUGH ENOUGH H-GRAPHS ARE HAMILTONIAN Adam Kabela
	10:20 - 10:45	Coffee break
	10:45 - 11:05	CYCLES AND PATHS IN LINE GRAPHS OF 3-HYPERGRAPHS Zdeněk Ryjáček
	11:10 - 11:30	EQUIVALENT FORMULATION OF THOMASSEN'S CONJECTURE USING TUTTE PATHS IN CLAW-FREE GRAPHS Petr Vrána
	11:35 - 11:55	CUT-THROUGH CONNECTIONS OF GRAPHS Juraj Valiska
	12:00 - 12:20	PROBLEM SESSION
	12:30 - 14:00	Lunch
	15:00 - 15:50	BINARY GRAY CODES Petr Gregor
	15:55 - 16:15	GRAPH ISOMORPHISM FOR S_d-GRAPHS Deniz Ağaoğlu
	16:20 - 16:45	Coffee break
	16:45 - 17:05	TESTING ISOMORPHISM OF CIRCULAR-ARC GRAPHS IN POLYNOMIAL TIME Roman Nedela
	17:10 - 17:30	AXES-PARALLEL UNIT DISK GRAPH RECOGNITION IS NP-HARD Onur Çağırıcı
	17:35 - 17:55	AN ALTERNATIVE REPRESENTATION OF ISOMORPHISMS AND AUTOMORPHISMS Peter Czimmermann
	18:00 - 18:20	TILINGS OF THE SPHERE BY ALMOST EQUILATERAL PENTAGONS Hoi Ping Luk
	19:00	Conference dinner
Friday 7 June 2019	07:30 - 09:00	Breakfast
	09:00 - 09:50	ON INCOMPLETE TOURNAMENTS SCHEDULING Petr Kovář
	09:55 - 10:15	REPETITION THRESHOLDS IN GRAPHS Borut Lužar
	10:20 - 10:45	Coffee break
	10:45 - 11:05	ON PRACTICAL ASPECTS OF SNARK GENERATION Ján Mazák
	11:10 - 11:30	FLOWS AND CIRCULAR FLOWS ON SIGNED CUBIC GRAPHS Anna Kompišová
	11:35 - 11:55	SHORT CYCLE COVERS OF GRAPHS WITH MINIMAL DEGREE 3 Robert Lukoťka
	12:00 - 12:20	ON ZERO-SUM FLOW NUMBERS OF HANOI GRAPHS Tao-Ming Wang
	12:30	Lunch