Characterizing the difference between graph classes defined by forbidden pairs including the claw (Q2287737)

In this paper, the authors characterize new families of connected graphs that are \(\{K_{1,3},Z_{2}\}\)-free but not \(B_{1,1}\)-free or \(\{K_{1,3},B_{1,m}\}\)-free but not \(P_{\max\{3m,m+4\}}\)-free for integers \(m \geq 1\), where \(Z_{i}\) denotes the graph obtained by identifying an endvertex of the path \(P_{i+1}\) with a vertex of a triangle and \(B_{1,m}\) denotes the graph obtained by identifying an end vertex of the path \(P_{m+1}\) with a degree 2 vertex of \(Z_{1}\). Furthermore, they present some applications of the characterization to the forbidden pair problems involving Hamilitonicity, generalized pancyclicity and spanning Halin subgraphs.