Adam Kabela

According to our database, Adam Kabela authored at least 17 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs.

Adam Kabela, Zdenek Ryjácek, Mária Skyvová, Petr Vrána

Discret. Math., 2024

2023

The smallest 5-chromatic tournament.

Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron

Math. Comput., August, 2023

No additional tournaments are quasirandom-forcing.

Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec

Eur. J. Comb., 2023

Improved Bounds for the Binary Paint Shop Problem.

Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Packing and covering directed triangles asymptotically.

Jacob W. Cooper, Andrzej Grzesik, Adam Kabela, Daniel Král'

Eur. J. Comb., 2022

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.

Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána

Discret. Math., 2022

Density Maximizers of Layered Permutations.

Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron

Electron. J. Comb., 2022

Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs.

Maria Chudnovsky, Adam Kabela, Binlong Li, Petr Vrána

Electron. J. Comb., 2022

2021

Coloring graphs by translates in the circle.

Pablo Candela, Carlos Catalá, Robert Hancock, Adam Kabela, Daniel Král', Ander Lamaison, Lluís Vena

Eur. J. Comb., 2021

Trestles in the squares of graphs.

Adam Kabela, Jakub Teska

Discret. Math., 2021

2019

Long paths and toughness of k-trees and chordal planar graphs.

Adam Kabela

Discret. Math., 2019

On forbidden induced subgraphs for K1, 3-free perfect graphs.

Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána

Discret. Math., 2019

2018

Planar graphs have two-coloring number at most 8.

Zdenek Dvorák, Adam Kabela, Tomás Kaiser

J. Comb. Theory B, 2018

An update on non-Hamiltonian 54-tough maximal planar graphs.

Adam Kabela

Discret. Math., 2018

Bounding the distance among longest paths in a connected graph.

Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska

Discret. Math., 2018

2017

10-tough chordal graphs are Hamiltonian.

Adam Kabela, Tomás Kaiser

J. Comb. Theory B, 2017

2015

10-tough chordal graphs are hamiltonian (Extended Abstract).

Adam Kabela, Tomás Kaiser

Electron. Notes Discret. Math., 2015