1 citations · 1 across the 4 of their papers we have counts for
4 papers
Every -connected -free graph is Hamilton-connected
Adam Kabela, Zdeněk Ryjáček, Mária Skyvová +1
We show that every -connected -free graph is Hamilton-connected, where is the graph obtained by joining two vertex-disjoint triangles with a path of lengt…
Proof of a conjecture on hamiltonian-connected graphs
Petr Vrana, Xingzhi Zhan, Leilei Zhang
We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Br…
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 …
Hamilton cycles in 5-connected line graphs
Tomáš Kaiser, Petr Vrána
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by s…