Title of article
9-Connected Claw-Free Graphs Are Hamilton-Connected
Author/Authors
Brandt، نويسنده , , Stephan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
7
From page
167
To page
173
Abstract
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1999
Journal title
Journal of Combinatorial Theory Series B
Record number
1526466
Link To Document