Adam Kabela

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 17

Top Topics

Dense Subgraphs

Maximal Cliques

Round Robin Tournament

Top Venues

Electron. J. Comb.

Publications

Adam Kabela, Zdenek Ryjácek, Mária Skyvová, Petr Vrána
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs. Discret. Math. 347 (11) (2024)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. Math. Comput. 93 (345) (2023)
Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108 (2023)
Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron
Density Maximizers of Layered Permutations. Electron. J. Comb. 29 (3) (2022)
Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345 (6) (2022)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. CoRR (2022)
Maria Chudnovsky, Adam Kabela, Binlong Li, Petr Vrána
Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs. Electron. J. Comb. 29 (2) (2022)
Jacob W. Cooper, Andrzej Grzesik, Adam Kabela, Daniel Král'
Packing and covering directed triangles asymptotically. Eur. J. Comb. 101 (2022)
Pablo Candela, Carlos Catalá, Robert Hancock, Adam Kabela, Daniel Král', Ander Lamaison, Lluís Vena
Coloring graphs by translates in the circle. Eur. J. Comb. 96 (2021)
Adam Kabela, Jakub Teska
Trestles in the squares of graphs. Discret. Math. 344 (11) (2021)
Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
On forbidden induced subgraphs for K1, 3-free perfect graphs. Discret. Math. 342 (6) (2019)
Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. CoRR (2019)
Adam Kabela
Long paths and toughness of k-trees and chordal planar graphs. Discret. Math. 342 (1) (2019)
Zdenek Dvorák, Adam Kabela, Tomás Kaiser
Planar graphs have two-coloring number at most 8. J. Comb. Theory, Ser. B 130 (2018)
Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska
Bounding the distance among longest paths in a connected graph. Discret. Math. 341 (4) (2018)
Adam Kabela
An update on non-Hamiltonian 54-tough maximal planar graphs. Discret. Math. 341 (3) (2018)
Adam Kabela, Tomás Kaiser
10-tough chordal graphs are Hamiltonian. J. Comb. Theory, Ser. B 122 (2017)
Adam Kabela, Tomás Kaiser
10-tough chordal graphs are hamiltonian (Extended Abstract). Electron. Notes Discret. Math. 49 (2015)