P. Vrána

collaborators

2 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.CO2019

On forbidden induced subgraphs for K_{1,3}-free perfect graphs

Christoph Brause, Přemysl Holub, Adam Kabela +3

Considering connected $K_{1, 3}$ -free graphs with independence number at least $3$ , Chudnovsky and Seymour (2010) showed that every such graph, say $G$ , is $2 ω$ -colourable where $ω$ …

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

On forbidden induced subgraphs for K_{1,3}-free perfect graphs

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