I agree that this site is using cookies. You can find further informations here.
X
Kabela, Adam
43  results:
Search for persons X
?
1

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

Kabela, Adam ; Ryjáček, Zdeněk ; Skyvová, Mária.
Discrete Mathematics.  347 (2024)  11 - p. 114154 , 2024
Link: https://doi.org/10.1016/..
 
?
2

No additional tournaments are quasirandom-forcing:

Hancock, Robert ; Kabela, Adam ; Král', Daniel...
European Journal of Combinatorics.  108 (2023)  - p. 103632 , 2023
Link: https://doi.org/10.1016/..
 
?
3

Forbidden induced subgraphs for perfectness of claw-free gr..:

Brause, Christoph ; Doan, Trung Duy ; Holub, Přemysl...
Discrete Mathematics.  345 (2022)  6 - p. 112837 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Packing and covering directed triangles asymptotically:

Cooper, Jacob W. ; Grzesik, Andrzej ; Kabela, Adam.
European Journal of Combinatorics.  101 (2022)  - p. 103462 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Trestles in the squares of graphs:

Kabela, Adam ; Teska, Jakub
Discrete Mathematics.  344 (2021)  11 - p. 112532 , 2021
Link: https://doi.org/10.1016/..
 
?
6

Coloring graphs by translates in the circle:

Candela, Pablo ; Catalá, Carlos ; Hancock, Robert...
European Journal of Combinatorics.  96 (2021)  - p. 103346 , 2021
Link: https://doi.org/10.1016/..
 
?
7

Long paths and toughness of k-trees and chordal planar grap..:

Kabela, Adam
Discrete Mathematics.  342 (2019)  1 - p. 55-63 , 2019
Link: https://doi.org/10.1016/..
 
?
8

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

Brause, Christoph ; Holub, Přemysl ; Kabela, Adam...
Discrete Mathematics.  342 (2019)  6 - p. 1602-1608 , 2019
Link: https://doi.org/10.1016/..
 
?
9

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

Kabela, Adam
Discrete Mathematics.  341 (2018)  3 - p. 579-587 , 2018
Link: https://doi.org/10.1016/..
 
?
10

Bounding the distance among longest paths in a connected gr..:

Ekstein, Jan ; Fujita, Shinya ; Kabela, Adam.
Discrete Mathematics.  341 (2018)  4 - p. 1155-1159 , 2018
Link: https://doi.org/10.1016/..
 
?
11

Planar graphs have two-coloring number at most 8:

Dvořák, Zdeněk ; Kabela, Adam ; Kaiser, Tomáš
Journal of Combinatorial Theory, Series B.  130 (2018)  - p. 144-157 , 2018
Link: https://doi.org/10.1016/..
 
?
12

10-tough chordal graphs are Hamiltonian:

Kabela, Adam ; Kaiser, Tomáš
Journal of Combinatorial Theory, Series B.  122 (2017)  - p. 417-427 , 2017
Link: https://doi.org/10.1016/..
 
?
13

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

Kabela, Adam ; Kaiser, Tomáš
Electronic Notes in Discrete Mathematics.  49 (2015)  - p. 331-336 , 2015
Link: https://doi.org/10.1016/..
 
?
14

Packing $T$-connectors in graphs needs more connectivity:

Čada, Roman ; Kabela, Adam ; Kaiser, Tomáš.
http://arxiv.org/abs/2308.07218.  , 2023
Link: http://arxiv.org/abs/230..
 
?
15

Forbidden induced pairs for perfectness and ω-colourability..:

Chudnovsky, Maria ; Kabela, Adam ; Li, Binlong.
Electronic Journal of Combinatorics.  , 2022
Link: http://hdl.handle.net/11..
 
1-15