CSGT | Grafy 2019

Program

Konferencia začína 3. júna 2019 (obedom) a končí 7. júna 2019 (obedom). Program konferencie bude pozostávať z pozvaných prednášok a prihlásených príspevkov. Dĺžka prihlásených príspevkov je 20 minút. Konferenčnými jazykmi sú angličtina, slovenčina a čeština, pričom v posledných dvoch prípadoch sa odporúča pripraviť si anglickú prezentáciu.

Abstrakty prednášok budú uverejnené v zborníku abstraktov.

Pre prednášajúcich bude k dispozícii dataprojektor, flipchart, tabuľa a notebook (formáty súborov, ktoré sú prijateľné pre prezentáciu: .ppt, .pdf, .ps).

V rámci programu konferencie bude organizovaný aj poldňový poznávací výlet.

Deň	Čas	Program
Pondelok 03.06.2019	10:00 - 12:30	Registrácia
	12:30 - 14:00	Obed
	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	Prestávka
	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	Uvítací večierok
Utorok 04.06.2019	07:30 - 09:00	Raňajky
	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	Prestávka
	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	Obed
	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	Prestávka
	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	Večera
Streda 05.06.2019	07:30 - 09:00	Raňajky
	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	Prestávka
	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	Konferenčná fotografia
	12:30 - 14:00	Obed
	14:00	VÝLET
	18:30 - 20:00	Večera
Štvrtok 06.06.2019	07:30 - 09:00	Raňajky
	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	Prestávka
	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	Obed
	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	Prestávka
	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	Konferenčná večera
Piatok 07.06.2019	07:30 - 09:00	Raňajky
	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	Prestávka
	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	Obed