9-Connected Claw-Free Graphs Are Hamilton-Connected

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced clawK1, 3are Hamilton-connected, by reformulating and localizing a closure concept due to Ryjáček, which turns claw-free graphs into line graphs.