papers


Doctoral Thesis: Structural Aspects of Graph Coloring [pdf]

Weak Coloring Numbers of Intersection Graphs [arXiv] [SoCG 2022] [LIPIcs] Zdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt, and Yelena Yuditsky

The minimum number of spanning trees in regular multigraphs [Electronic Journal of Combinatorics 2022] [preprint part I, part II] Jakub Pekárek, Jean-Sébastien Sereni, Zelealem B. Yilma

Griddings of permutations and hardness of pattern matching [arXiv] [LIPIcs 2021] Vít Jelínek, Michal Opler, Jakub Pekárek

Long paths make pattern-counting hard, and deep trees make it harder [arXiv] [LIPIcs 2021] Vít Jelínek, Michal Opler, Jakub Pekárek

Interval representation of balanced separators in graphs avoiding a minor [EUROCOMB 2021] Zdeněk Dvořák, Jakub Pekárek, Robert Šámal

A note on connected greedy edge colouring [arXiv] [Discrete Applied Mathematics 2021] Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek

Characterization of 4-critical Triangle-free Toroidal Graphs [arXiv] [Journal of Combinatorial Theory 2022] Zdeněk Dvořák, Jakub Pekárek

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes [arXiv] [MFCS 2020] Vít Jelínek, Michal Opler, Jakub Pekárek

Induced odd cycle packing number, independent sets, and chromatic number [arXiv] [EUROCOMB 2019] [Journal of Graph Theory] Zdeněk Dvořák, Jakub Pekárek

Coloring Near-Quadrangulations of the Cylinder and the Torus [arXiv] [European Journal of Combinatorics 2021] Zdeněk Dvořák, Jakub Pekárek

On Generalized Choice and Coloring Numbers [arXiv] [Electronic Journal of Combinatorics 2019] Zdeněk Dvořák, Jakub Pekárek, Jean-Sébastien Sereni

Irreducible 4-critical Triangle-free Toroidal Graphs [arXiv] [Electronic Notes in Discrete Mathematics] [code] [EUROCOMB 2017] Zdeněk Dvořák, Jakub Pekárek

On the Simultaneous Minimum Spanning Trees Problem [arXiv] [CALDAM 2018] [journal] Matěj Konečný, Stanislav Kučera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tětek, Martin Töpfer

Minimal Sum Labeling of Graphs [arXiv] [Journal of Discrete Algorithms] [IWOCA 2017] [arXiv] Matěj Konečný, Stanislav Kučera, Jana Novotná, Jakub Pekárek, Štěpán Šimsa, Martin Töpfer

other unpublished research and manuscripts

On Time of Turing Machines and Depth of Circuits [report] Pavel Dvořák, Kyle Hess, Lukáš Ondráček, Jakub Pekárek

Group Isomorphism Problem and Nondeterministic Space-bounded Classes [report] [manuscript] Matěj Konečný, Jakub Pekárek, Václav Rozhoň, Štěpán Šimsa

Ramsey Number for Binary Matrices in REU summary [report]