On Hamiltonicity of \{claw, net\}-free graphs (Q2433732): Difference between revisions

A path with an endvertex \(s\) is called an \(s\)-path and likewise \(st\)-paths are ones with endvertices \(s\) and \(t\). Conditions are given that imply a \(CN\)-free graph, where \(C\) is a claw and \(N\) is a net, has \(s\)-paths and \(st\)-paths that are Hamiltonian. For example it is shown that if \(G\) is a graph of order at least \(3\) with \(\kappa(G) = 1\), then \(G\) has an \(st\)-path that is Hamiltonian if and only if \(s\) and \(t\) are inner vertices of different endblocks of \(G\). Similar results are given for \(s\)-paths and \(st\)-paths that contain a predetermined edge \(e\). Also, corresponding results are given for Hamiltonian cycles in a \(2\)-connected \(CN\)-free graph. These theorems generalize know results for the existence of Hamiltonian paths and cycles in \(CN\)-free graphs.