Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
Let \(Z_i\) be the graph obtained by attaching an endvertex of a path of length \(i\) to a vertex of a triangle for a positive integer \(i\). The authors prove that every 3-connected \(K_{1,3}\), \(Z_7\)-free graph is Hamilton-connected, with one exceptional graph.
scientific article; zbMATH DE number 7340577