Adam Kabela | kabela@kma.zcu.cz | Department of Mathematics, office UC 257

I work as an assistant professor at the Faculty of Applied Sciences, University of West Bohemia. Before that I was a postdoctoral researcher at the Faculty of Informatics, Masaryk University working with Dan Kráľ. Before before that I was a researcher and a Ph.D. student at the University of West Bohemia, my studies were advised by Tomáš Kaiser.

I am interested in Combinatorics and Graph Theory. The results of my research can be found listed below.

## Papers

No additional tournaments are quasirandom-forcing with R. Hancock, D. Kráľ, T. Martins, R. Parente, F. Skerman and J. Volec.

Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs with P. Vrána.

Hadwiger meets Cayley with J. W. Cooper, D. Král' and T. Pierron.

Density maximizers of layered permutations with D. Kráľ, J. Noel and T. Pierron, Electronic Journal of Combinatorics, to appear.

Forbidden induced pairs for perfectness and ω-colourability of graphs with M. Chudnovsky, B. Li and P. Vrána, Electronic Journal of Combinatorics (2022).

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 with C. Brause, T. D. Doan, P. Holub, Z. Ryjáček, I. Schiermeyer and P. Vrána, Discrete Mathematics (2022).

Packing and covering directed triangles asymptotically with J. W. Cooper, A. Grzesik and D. Kráľ, European Journal of Combinatorics (2022).

Trestles in the squares of graphs with J. Teska, Discrete Mathematics (2021) .

Coloring graphs by translates in the circle with P. Candela, C. Catalá, R. Hancock, D. Kráľ, A. Lamaison and L. Vena, European Journal of Combinatorics (2021).

On forbidden induced subgraphs for K_{1,3}-free perfect graphs with C. Brause, P. Holub, Z. Ryjáček, I. Schiermeyer and P. Vrána, Discrete Mathematics (2019).

Long paths and toughness of k-trees and chordal planar graphs, Discrete Mathematics (2019).

Planar graphs have two-coloring number at most 8 with Z. Dvořák and T. Kaiser, Journal of Combinatorial Theory, Series B (2018).

Bounding the distance among longest paths in a connected graph with J. Ekstein, S. Fujita and J. Teska, Discrete Mathematics (2018).

An update on non-Hamiltonian 5/4-tough maximal planar graphs, Discrete Mathematics (2018).

10-tough chordal graphs are Hamiltonian with T. Kaiser, Journal of Combinatorial Theory, Series B (2017).

## Talks

Forbidden induced pairs and additional constraints for perfectness and ω-colourability of graphs (joint work with M. Chudnovsky, B. Li and P. Vrána), 6th Xi'an International Workshop on Graph Theory and Combinatorics, online, 2022.

An introduction to induced-saturated graphs (joint work with P. Dvořák, T. Kaiser, M. Opler, T. Pierron and A. Šťastná), STIGMA, 2021.

Layered permutations and their density maximisers (joint work with D. Král', J. Noel and T. Pierron), Permutation Patterns, online, 2021.

Disproving a conjecture on layered permutation density maximisers (joint work with D. Král', J. Noel and T. Pierron), seminar of the G²OAT research group, online, 2021.

Disproving a conjecture on layered permutation density maximisers (joint work with D. Král', J. Noel and T. Pierron), 55th Czech-Slovak Conference on Graph Theory, Czech Republic, 2020.

Quasirandom-forcing tournaments (joint work with R. Hancock, D. Kráľ, T. Martins, R. Parente, F. Skerman and J. Volec), Comenius University in Bratislava, Seminar series on Graph Theory, Slovakia, 2019.

Forbidden pairs and perfect graphs (joint work with P. Vrána), Midsummer Combinatorial Workshop XXIV, Czech Republic, 2019.

Forbidden pairs and perfect graphs (joint work with P. Vrána), Ghent Graph Theory Workshop, Belgium, 2019.

Tough enough H-graphs are Hamiltonian (joint work with T. Kaiser), The 54th Czech-Slovak Conference Graphs 2019, Slovakia, 2019.

Equivalent formulation of Thomassen's conjecture using Tutte paths in K_{1,3}-free graphs (joint work with P. Vrána), 10th Workshop on the Matthews-Sumner Conjecture and Related Problems, Czech Republic, 2019.

Toughness and Hamiltonicity and using duality theorems (joint work with T. Kaiser and H. Broersma), University of Bergen, Seminar series of the Algorithms Research Group, Norway, 2018.

Spanning a tough graph (joint work with T. Kaiser and H. Broersma), Bucharest Graph Theory Workshop, Romania, 2018.

Bounding shortness exponent of tough maximal planar graphs, The 52nd Czech-Slovak Conference on Combinatorics and Graph Theory, Czech Republic, 2017.

Toughness and Hamiltonicity for special graph classes (joint work with H. Broersma, H. Qi and E. Vumar), Bordeaux Graph Workshop 2016, France, 2016.

10-tough chordal graphs are Hamiltonian (joint work with T. Kaiser), The 51th Czech-Slovak Conference Grafy 2016, Slovakia, 2016.

## Ph.D. Thesis

Toughness and Hamiltonicity of graphs, University of West Bohemia, 2018.