I am a postdoctoral researcher at the Faculty of Informatics, Masaryk University in Brno, Czech Republic, under the supervision of Dan Kráľ. You can reach me at kabela[at]fi.muni.cz.

In 2018, I defended my Ph.D. thesis at the Faculty of Applied Sciences, University of West Bohemia in Pilsen. My Ph.D. studies were advised by Tomáš Kaiser.

I study Structural Graph Theory. The results of my research are to be found listed below.

## Papers

Papers

- 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

Talks

*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.