Strona: Programme / Rzeszów Workshop on Graph Theory

Programme

Monday
17:00 - 21:00 Registration
18:30 Dinner
Tuesday
9:15 - 9:45 Registration
9:45 - 10:00 Opening ceremony
10:00 - 10:50 Tomáš Madaras Homogeneous colorings of graphs
10:55 - 11:25 Coffee break
11:25 - 11:45 Stanislav Jendroľ On a 3-coloring of plane graphs without monochromatic facial 3-paths
11:50 - 12:10 Magdalena Lemańska Graphs with isolation number equal to one third of the order
12:15 - 12:30 Conference photo
13:00 - 14:00 Lunch
14:45 - 15:35 Andrzej Ruciński Homogeneous substructures in random ordered uniform matchings
15:40 - 16:10 Coffee break
16:10 - 16:30 Urszula Bednarz On perfect multiple domination in graphs
16:35 - 16:55 Engin Özkan Generalized Copper Fibonacci Sequences and their Polynomials
18:00 Dinner
Wednesday
08:30 - 14:00 Trip to Łańcut Castle
14:30 - 15:30 Lunch
16:00 - 16:20 Peter Borg Isolation of graphs
16:25 - 16:45 Karl Bartolo Isolation of 3-vertex paths
16:50 - 17:10 Dayle Scicluna Isolation of cycles in graphs
18:30 Dinner
Thursday
10:00 - 10:50 Mariusz Woźniak Distinguishing graph vertices using edge coloring
10:55 - 11:25 Coffee break
11:25 - 11:45 Igor Grzelec Weak and strong local irregularity of digraphs
11:50 - 12:10 Elżbieta Turowska Quasi-majority neighbor sum distinguishing edge-colorings
13:00 - 14:00 Lunch
14:45 - 15:35 Jan Kratochvíl Hamilton paths and cycles in dense graphs
15:40 - 16:10 Coffee break
16:10 - 16:30 Magda Dettlaff Mobile mutual-visibility sets in graphs
16:35 - 16:55 Mateusz Miotk Certified Dominating Sets with Certificates Practical Application of an ILP Model
19:00 Banquet
Friday
9:45 - 10:35 Elżbieta Sidorowicz Colouring-based connectivity parameters in digraphs
10:40 - 11:10 Coffee break
11:10 - 11:30 Izolda Gorgol Some Issues on Disjoint Copies of Graphs in Ramsey Theory
11:35 - 11:55 Mateusz Pirga The number of independent sets including the set of leaves in graphs
12:00 - 12:10 Closing ceremony
12:15 - 13:15 Lunch (participants who depart earlier will receive a packed lunch)