The Sborníček is available.
B | C | D | E | I | |
---|---|---|---|---|---|
1 | Day | Time | First Name | Surname | Název přednášky / Title of the talk |
2 | Mon | 9:00-10:00 | Martin | Škoviera | Snarks that cannot be covered with four perfect matchings |
3 | Mon | 10:30-10:50 | Roman | Nedela | Nullstellensatz and the recognition of snarks |
4 | Mon | 10:55-11:15 | Robert | Lukoťka | $6$-circuits in $2$-factors of cubic graphs |
5 | Mon | 11:20-11:30 | Edita | Máčajová | Smallest nontrivial snarks with oddness 4 |
6 | Mon | 11:35-11:45 | Mária | Janicová | Proper colour-homogeneity of regular graphs |
7 | Mon | 11:50-12:00 | Radek | Hušek | Homomorphisms of Cayley graphs and Cycle Double Covers |
8 | Mon | 14:00-15:00 | Zuzana | Masáková | Combinatorics on words in quasicrystals and number theory |
9 | Mon | 15:30-15:50 | Roman | Soták | New bound for generalized nonrepetitive sequences |
10 | Mon | 15:55-16:15 | Borut | Lužar | Results on locally irregular edge-coloring |
11 | Mon | 16:20-16:30 | Ida | Kantor | Minimum difference representations of graphs |
12 | Mon | 16:50-17:00 | Dalibor | Fronček | Products of cycles labeled by cyclic groups |
13 | Mon | 17:05-17:15 | Petr | Kovář | Supermagic graphs with many different degrees |
14 | Mon | 17:20-17:30 | Adam | Silber | Chromatic index of graphs for incomplete round-robin tournaments. |
15 | Mon | 17:35-17:45 | Matěj | Krbeček | On modified handicap labelings |
16 | Mon | 17:50-18:00 | Mirko | Horňák | On one of directed versions of the 1-2-3 Conjecture |
17 | Mon | 18:05-18:15 | Juraj | Valiska | Conflict-free connection of graphs |
18 | Tue | 9:00-10:00 | Martin | Tancer | Untangling graphs and curves on surfaces |
19 | Tue | 10:30-10:50 | Hans Raj | Tiwary | Convex hull of Walks in a Graph |
20 | Tue | 10:55-11:15 | Igor | Fabrici | Unique-maximum total coloring of plane graphs |
21 | Tue | 11:20-11:30 | Mária | Maceková | Light edges in plane graphs with prescribed dual edge weight |
22 | Tue | 11:35-11:45 | Martina | Sabová | On existence of cycles of specific lengths in planar graphs with restricted minimum degree and edge weight. |
23 | Tue | 11:50-12:00 | Erika | Vojtková | Structure of $k$-planar graphs |
24 | Tue | 14:00-15:00 | Marcin | Kozik | Algebraist's view on CSP |
25 | Tue | 15:30-15:50 | Jack | Koolen | On edge-regular graphs with regular cliques |
26 | Tue | 15:55-16:15 | Robert | Jajcay | Automorphism groups of Praeger-Xu graphs |
27 | Tue | 16:20-16:30 | Tatiana | Jajcayova | Applications of Bass-Serre Theory to inverse semigroups. |
28 | Wed | 9:00-10:00 | Marcin | Pilipczuk | The square root phenomenon, subexponential algorithms, and low treewidth pattern covering in planar graphs |
29 | Wed | 10:30-10:50 | Petr | Gregor | Multiple message broadcasting in the 1-in port model |
30 | Wed | 10:55-11:15 | Dušan | Knop | Target Set Selection in Dense Graphs |
31 | Wed | 11:20-11:30 | Tomáš | Masařík | Parameterized complexity of metatheorems of fair deletion problems |
32 | Wed | 11:35-11:45 | Jana | Maxová | Cover-incomparability graphs of posets |
33 | Wed | 11:50-12:00 | Ján | Mazák | Traveling salesman problem in cubic graphs |
34 | afternoon trip | ||||
35 | Thu | 9:00-10:00 | Edita | Rollová | Signed graphs- flows and related topics |
36 | Thu | 10:30-10:50 | Martina | Mockovčiaková | Star chromatic index of subcubic graphs |
37 | Thu | 10:55-11:15 | Tomáš | Kaiser | Decomposing planar graphs |
38 | Thu | 11:20-11:30 | Jan | Ekstein | Revisiting the Hamiltonian Theme in the Square of a Block |
39 | Thu | 11:35-11:45 | Adam | Kabela | Bounding shortness exponent of tough maximal planar graphs |
40 | Thu | 11:50-12:00 | Jan | Bok | Extremal Problems for Wiener Index |
41 | Thu | 14:00-15:00 | František | Kardoš | Graph-theoretic properties and invariants of fullerene graphs |
42 | Thu | 15:30-15:50 | Štefan | Gyürki | Constructions of directed strongly regular graphs with the aid of voltage graphs and quotient graphs |
43 | Thu | 15:55-16:15 | Marcel | Abas | A construction of large Cayley digraphs of given degree and diameter |
44 | Thu | 16:20-16:30 | István | Estélyi | An infinite family of cubic vertex-transitive Haar graphs that are not Cayley graphs |
45 | Fri | 9:00-10:00 | Patrice | Ossona de Mendez | Modeling Limits |
46 | Fri | 10:30-10:50 | Jan | Hubička | Very sparse graphs are Ramsey |
47 | Fri | 10:55-11:15 | Maria | Saumell | A median-type condition for graph tiling |
48 | Fri | 11:20-11:30 | Peter | Zeman | Jordan-like characterizations of automorphism groups for restricted classes of graphs |
49 | Fri | 11:35-11:45 | Pavel | Klavík | Jordan-like characterization of automorphism groups of planar graphs |
50 | Fri | 11:50-12:00 | Michael | Kubesa | Factorizations of complete graphs into tadpoles |