1 citations · 1 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs
Adam Kabela, Zdeněk Ryjáček, Petr Vrána
We continue studying Thomassen's conjecture (every 4-connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2-…
math.CO2019
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
Christoph Brause, Přemysl Holub, Adam Kabela +3
Considering connected -free graphs with independence number at least , Chudnovsky and Seymour (2010) showed that every such graph, say , is -colourable where …