8.00-
9.00 | Breakfast |
9.00-
9.50 | Charles Curtis Lindner
|
9.55-
10.25 | Coffee Break |
|
| Session A |
10.25-
10.40 | Ervin Gyori
| | On general neighbor distinguishing index of graphs |
|
10.45-
11.00 | Mariusz Wozniak
| | On neighbour-distinguishing colourings from lists |
|
11.05-
11.20 | Jakub Przybylo
| | Decompositions and irregular colorings of graphs |
|
11.25-
11.40 | Izolda Gorgol
| | Rainbow numbers for certain graphs |
|
11.45-
12.00 | Halina Bielak
| | Size Ramsey numbers for some regular graphs |
|
12.05-
12.20 | Martin Kochol
| | Approximation of 3-Edge-Coloring of Cubic Graphs is Difficult |
|
|
| Session B |
10.25-
10.40 | Harald Gropp
| | Hamiltonian graphs from Kirkman to König |
|
10.45-
11.00 | Evelyne Flandrin
| | Hamiltonicity and pancyclicity of generalized prisms |
|
11.05-
11.20 | Edita Macajova
| | Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 |
|
11.25-
11.40 | Joy Singleton
| | Maximal Nontraceable Graphs with Toughness less than One |
|
11.45-
12.00 | Lech Adamus
| | Long cycles in graphs and digraphs |
|
12.05-
12.20 | Roman Cada
| | Path factors in claw-free graphs
|
|
|
12.30-
13.30 | Lunch |
14.30-
15.20 | Michal Karonski
|
15.25-
15.55 | Coffee Break |
15.55-
16.45 | Bojan Mohar
|
|
| Session A |
17.00-
17.15 | Matiaz Kovse
| | The Lattice Dimension of Benzenoid Systems
|
|
17.20-
17.35 | Roman Nedela
| | Chiral maps of prescribed type arising from An
|
|
17.40-
17.55 | Malgorzata Kuchta
| | Embeddings of a chain into a binary tree |
|
18.00-
18.15 | Kahina Meslem
| | Isometric embedding of subdivided Connected Graphs in the Hypercube |
|
|
| Session B |
17.00-
17.15 | Kiyoshi Ando
| | Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph |
|
17.20-
17.35 | Takuro Fukunaga
| | Some Theorems on Detachments Preserving Local-Edge-Connectivity |
|
17.40-
17.55 | Simon Spacapan
| | Vertex and edge connectivity of graph products |
|
18.00-
18.15 | Joanna Polcyn
| | Short paths in quasi-random graphs
|
|
|
|
|
