Menu

Předběžný program

Sborníček je dostupný online.

  • neděle 28. května: příjezd
  • pondělí 29. května: celodenní odborný program
  • úterý 30. května: celodenní odborný program
  • středa 31. května: dopolední odborný program, odpoledne konferenční výlet
  • čtvrtek 1. června: celodenní odborný program, večer prohlídka kláštera, koncert a konferenční večeře
  • pátek 2. června: dopolední odborný program, konference končí obědem, odjezd.
BCDEI
1
DayTime
First Name
SurnameNázev přednášky / Title of the talk
2
Mon
9:00-10:00
MartinŠkovieraSnarks that cannot be covered with four perfect matchings
3
Mon
10:30-10:50
RomanNedelaNullstellensatz and the recognition of snarks
4
Mon
10:55-11:15
RobertLukoťka$6$-circuits in $2$-factors of cubic graphs
5
Mon
11:20-11:30
EditaMáčajováSmallest nontrivial snarks with oddness 4
6
Mon
11:35-11:45
MáriaJanicováProper colour-homogeneity of regular graphs
7
Mon
11:50-12:00
RadekHušekHomomorphisms of Cayley graphs and Cycle Double Covers
8
Mon
14:00-15:00
ZuzanaMasákováCombinatorics on words in quasicrystals and number theory
9
Mon
15:30-15:50
RomanSotákNew bound for generalized nonrepetitive sequences
10
Mon
15:55-16:15
BorutLužarResults on locally irregular edge-coloring
11
Mon
16:20-16:30
IdaKantorMinimum difference representations of graphs
12
Mon
16:50-17:00
DaliborFrončekProducts of cycles labeled by cyclic groups
13
Mon
17:05-17:15
PetrKovářSupermagic graphs with many different degrees
14
Mon
17:20-17:30
AdamSilberChromatic index of graphs for incomplete round-robin tournaments.
15
Mon
17:35-17:45
MatějKrbečekOn modified handicap labelings
16
Mon
17:50-18:00
MirkoHorňákOn one of directed versions of the 1-2-3 Conjecture
17
Mon
18:05-18:15
JurajValiskaConflict-free connection of graphs
18
Tue
9:00-10:00
MartinTancerUntangling graphs and curves on surfaces
19
Tue
10:30-10:50
Hans RajTiwaryConvex hull of Walks in a Graph
20
Tue
10:55-11:15
IgorFabriciUnique-maximum total coloring of plane graphs
21
Tue
11:20-11:30
MáriaMacekováLight edges in plane graphs with prescribed dual edge weight
22
Tue
11:35-11:45
MartinaSabováOn existence of cycles of specific lengths in planar graphs with restricted minimum degree and edge weight.
23
Tue
11:50-12:00
ErikaVojtkováStructure of $k$-planar graphs
24
Tue
14:00-15:00
MarcinKozikAlgebraist's view on CSP
25
Tue
15:30-15:50
JackKoolenOn edge-regular graphs with regular cliques
26
Tue
15:55-16:15
RobertJajcayAutomorphism groups of Praeger-Xu graphs
27
Tue
16:20-16:30
TatianaJajcayovaApplications of Bass-Serre Theory to inverse semigroups.
28
Wed
9:00-10:00
MarcinPilipczuk
The square root phenomenon, subexponential algorithms, and low treewidth pattern covering in planar graphs
29
Wed
10:30-10:50
PetrGregorMultiple message broadcasting in the 1-in port model
30
Wed
10:55-11:15
DušanKnopTarget Set Selection in Dense Graphs
31
Wed
11:20-11:30
TomášMasaříkParameterized complexity of metatheorems of fair deletion problems
32
Wed
11:35-11:45
JanaMaxováCover-incomparability graphs of posets
33
Wed
11:50-12:00
JánMazákTraveling salesman problem in cubic graphs
34
afternoon trip
35
Thu
9:00-10:00
EditaRollováSigned graphs- flows and related topics
36
Thu
10:30-10:50
MartinaMockovčiakováStar chromatic index of subcubic graphs
37
Thu
10:55-11:15
TomášKaiserDecomposing planar graphs
38
Thu
11:20-11:30
JanEksteinRevisiting the Hamiltonian Theme in the Square of a Block
39
Thu
11:35-11:45
AdamKabelaBounding shortness exponent of tough maximal planar graphs
40
Thu
11:50-12:00
JanBokExtremal Problems for Wiener Index
41
Thu
14:00-15:00
FrantišekKardošGraph-theoretic properties and invariants of fullerene graphs
42
Thu
15:30-15:50
ŠtefanGyürkiConstructions of directed strongly regular graphs with the aid of voltage graphs and quotient graphs
43
Thu
15:55-16:15
MarcelAbasA construction of large Cayley digraphs of given degree and diameter
44
Thu
16:20-16:30
IstvánEstélyiAn 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
JanHubičkaVery sparse graphs are Ramsey
47
Fri
10:55-11:15
MariaSaumellA median-type condition for graph tiling
48
Fri
11:20-11:30
PeterZemanJordan-like characterizations of automorphism groups for restricted classes of graphs
49
Fri
11:35-11:45
PavelKlavíkJordan-like characterization of automorphism groups of planar graphs
50
Fri
11:50-12:00
MichaelKubesaFactorizations of complete graphs into tadpoles