|
THURSDAY 21.11.2019 |
|||
|
7:00-9:00 |
breakfast |
||
|
8:00 |
BUS from Cracow to Dosłońce |
||
|
10:15-10:45 |
cofee |
||
|
|
Room A chairman: Wilfried Imrich |
Room B chairman: Przemysław Gordinowicz |
|
|
10:45-11:05 |
Stawiski Marcin, INFINITE MOTION CONJECTURE FOR TREES OF ARBITRARY CARDINALITY |
Paweł Bednarz, ON (2-D)-KERNELS IN GENERALIZED PETERSEN GRAPHS |
|
|
11:10-11:30 |
Rafał Kalinowski, ASYMMETRIC EDGE-COLOURINGS OF 2-CONNECTED COUNTABLE GRAPHS |
Adrian Michalski, PARAMETERS OF SECONDARY DOMINATION IN GRAPHS |
|
|
11:35-11:55 |
Mariusz Grech, DISTINGUISHING NUMBER OF THE GRAPHS WITH SIMPLE AUTOMORPHISM GROUP |
|
|
|
12:00-12:20 |
Florian Lehner, ASYMMETRIC COLOURINGS OF GRAPHS WITH BOUNDED MAXIMAL DEGREE |
|
|
|
12:30-13:30 |
lunch |
||
|
|
Room A chairman: Liming Xiong |
||
|
15:30-16:15 |
Jakub Kozik, BI-UNIFORM PROPERTY B |
||
|
16:15-16:45 |
cofee break |
||
|
|
Room A chairman: Mariusz Woźniak |
Room B chairman: Elżbieta Sidorowicz |
|
|
16:45-17:05 |
Wilfried Imrich, THE STRUCTURE OF QUARTIC GRAPHS WITH MINIMAL SPECTRAL GAP |
Marcin Anholcer, NEW RESULTS ON THE PRODUCT-IRREGULAR LABELINGS OF GRAPHS |
|
|
17:10-17:30 |
Liming Xiong, SMALL CIRCUMFERENCE AND TRACEABLE GRAPHS |
Petr Kovář, VERTEX IN-OUT-ANTIMAGIC TOTAL LABELING OF DIGRAPHS |
|
|
17:35-17:55 |
Xueliang Li, ON RAINBOW DISCONNECTIONS OF GRAPHS |
Michał Dębski, EDGE COLORINGS AVOIDING PATTERNS
|
|
|
18:30 |
dinner |
||
|
FRIDAY 22.11.2019 |
||
|
7:00-9:00 |
breakfast |
|
|
|
Room A chairman: Andrzej Ruciński |
|
|
9:30-10:15 |
Oleg Pikhurko, MEASURABLE VERSION OF VIZING’S THEOREM |
|
|
10:15-10:45 |
cofee break |
|
|
|
Room A chairman: Florian Lehner |
Room B chairman: Mariusz Grech |
|
10:45-11:05 |
Małgorzata Śleszyńska-Nowak, STRONG CLIQUES IN GRAPHS |
Borut Lužar, HOMOGENEOUS COLORING OF VERTICES |
|
11:10-11:30 |
Mária Maceková, ACYCLIC EDGE COLORING OF SPARSE GRAPHS |
Sylwia Cichacz-Przeniosło, MINIMAL BIREGULAR K-CRITICAL BIPARTITE GRAPHS |
|
11:35-11:55 |
Przemysław Gordinowicz, THE POLYNOMIAL METHOD FOR VARIATIONS OF THOMASSEN PROOF ON LIST COLOURING |
Wit Foryś, CELLULAR AUTOMATA SOME CLASSIFICATION PROBLEMS
|
|
12:00-12:20 |
Elżbieta Sidorowicz, SUM-LIST COLOURING OF HYPERGRAPHS |
Andrzej Żak, ON THE MINIMUM SIZE OF HAMILTONIAN SATURATED HYPERGRAPHS |
|
12:30-13:30 |
lunch |
|
|
|
Room A chairman: Xueliang Li |
|
|
15:30-16:15 |
Roman Soták, 3-COLORABILITY AND 3-CHOOSABILITY OF PLANAR GRAPHS |
|
|
16:15-16:45 |
cofee break |
|
|
|
Room A
chairman: Petr Kovář |
|
|
16:45-17:15 |
Open problems session |
|
|
18:30 |
banquet |
|
|
SATURDAY 23.11.2019 |
|
|
7:00-9:00 |
breakfast |
|
10:00 |
BUS to Cracow |