Adam Kabela

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