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.

You can reach me at kabela[at]kma.zcu.cz.

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

## Papers

C. Brause, T. D. Doan, P. Holub, A. Kabela, Z. Ryjáček, I. Schiermeyer, P. Vrána:

*Forbidden induced subgraphs and perfectness for claw-free graphs of independence at least 4,*arXiv.J. W. Cooper, A. Kabela, D. Král', T. Pierron:

*Hadwiger meets Cayley*, arXiv.P. Candela, C. Catalá, R. Hancock, A. Kabela, D. Kráľ, A. Lamaison, L. Vena:

*Coloring graphs by translates in the circle*, arXiv.A. Kabela, J. Teska:

*Trestles in the squares of graphs*, arXiv.R. Hancock, A. Kabela, D. Kráľ, T. Martins, R. Parente, F. Skerman, J. Volec:

*No additional tournaments are quasirandom-forcing*, arXiv.J. W. Cooper, A. Grzesik, A. Kabela, D. Kráľ:

*Packing and covering directed triangles asymptotically*, arXiv.A. Kabela, P. Vrána:

*Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs*, arXiv.C. Brause, P. Holub, A. Kabela, Z. Ryjáček, I. Schiermeyer, P. Vrána:

*On forbidden induced subgraphs for K_{1,3}-free perfect graphs,*Discrete Mathematics (2019)A. Kabela:

*Long paths and toughness of k-trees and chordal planar graphs,*Discrete Mathematics (2019) and arXiv .Z. Dvořák, A. Kabela, T. Kaiser:

*Planar graphs have two-coloring number at most 8*, Journal of Combinatorial Theory, Series B (2018) and arXiv.J. Ekstein, S. Fujita, A. Kabela, J. Teska:

*Bounding the distance among longest paths in a connected graph*, Discrete Mathematics (2018) and arXiv .A. Kabela:

*An update on non-Hamiltonian 5/4-tough maximal planar graphs*, Discrete Mathematics (2018) and arXiv.A. Kabela, T. Kaiser:

*10-tough chordal graphs are Hamiltonian*, Journal of Combinatorial Theory, Series B (2017) and arXiv.

## Talks

*Disproving a conjecture on layered permutation density maximisers*(joint work with J. W. Cooper, A. Kabela, D. Král' and T. Pierron), 55th Czech-Slovak Conference on Graph Theory, Czech Republic, 2020.*Quasirandom-forcing tournaments*(joint work with R. Hancock, A. Kabela, 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.