Adam Kabela

Available identifiers

zbMath Open kabela.adamMaRDI QIDQ322252

List of research outcomes

Publication	Date of Publication	Type
Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected	2024-12-02	Paper
Improved bounds for the binary paint shop problem	2024-08-22	Paper
A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs	2024-08-19	Paper
The smallest 5-chromatic tournament	2023-10-23	Paper
Packing $T$-connectors in graphs needs more connectivity	2023-08-14	Paper
The number of abundant elements in union-closed families without small sets	2022-12-19	Paper
No additional tournaments are quasirandom-forcing	2022-12-01	Paper
Density maximizers of layered permutations	2022-10-06	Paper
Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs	2022-05-12	Paper
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4	2022-04-11	Paper
Packing and covering directed triangles asymptotically	2022-01-13	Paper
Trestles in the squares of graphs	2021-09-06	Paper
Coloring graphs by translates in the circle	2021-06-18	Paper
Hadwiger meets Cayley	2020-05-12	Paper
Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs	2019-07-18	Paper
On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs	2019-06-27	Paper
Long paths and toughness of \(k\)-trees and chordal planar graphs	2018-11-13	Paper
Planar graphs have two-coloring number at most 8	2018-04-18	Paper
Bounding the distance among longest paths in a connected graph	2018-02-23	Paper
An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs	2018-01-19	Paper
10-tough chordal graphs are Hamiltonian	2016-11-25	Paper
10-tough chordal graphs are Hamiltonian (extended abstract)	2016-10-14	Paper

Research outcomes over time

This page was built for person: Adam Kabela