Adam Kabela

collaborators

3 papers

math.CO2024

Every $3$ -connected ${K_{1, 3}, Γ_{3}}$ -free graph is Hamilton-connected

Adam Kabela, Zdeněk Ryjáček, Mária Skyvová +1

We show that every $3$ -connected ${K_{1, 3}, Γ_{3}}$ -free graph is Hamilton-connected, where $Γ_{3}$ is the graph obtained by joining two vertex-disjoint triangles with a path of lengt…

math.CO2024

A closure for Hamilton-connectedness in ${K_{1, 3}, Γ_{3}}$ -free graphs

Adam Kabela, Zdeněk Ryjáček, Mária Skyvová +1

We introduce a closure technique for Hamilton-connectedness of ${K_{1, 3}, Γ_{3}}$ -free graphs, where $Γ_{3}$ is the graph obtained by joining two vertex-disjoint triangles with a path…

math.CO2023

Packing $T$ -connectors in graphs needs more connectivity

Roman Čada, Adam Kabela, Tomáš Kaiser +1

Strengthening the classical concept of Steiner trees, West and Wu [J. Combin. Theory Ser. B 102 (2012), 186--205] introduced the notion of a $T$ -connector in a graph $G$ with a set…

Every 3-connected {K1,3​,Γ3​}-free graph is Hamilton-connected

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

Packing T-connectors in graphs needs more connectivity

Every $3$ -connected ${K_{1, 3}, Γ_{3}}$ -free graph is Hamilton-connected

A closure for Hamilton-connectedness in ${K_{1, 3}, Γ_{3}}$ -free graphs

Packing $T$ -connectors in graphs needs more connectivity