Hamiltonicity in 2-connected graphs with claws (Q1382829): Difference between revisions

Several papers have been written on claw-free graphs (a graph is claw-free if it does not contain a copy of \(K_{1,3}\) as an induced subgraph). In particular, \textit{M. Matthews} and \textit{D. Sumner} [J. Graph Theory 8, 139-146 (1984; Zbl 0536.05047); ibid. 9, 269-277 (1985; Zbl 0591.05041)] considered conditions under which a claw-free graph is hamiltonian. In the present paper the authors consider conditions for a 2-connected graph with claws to be hamiltonian.