1-Tough cocomparability graphs are hamiltonian Original Research Article
Author/Authors :
Jitender S. Deogun، نويسنده , , Dieter Kratsch، نويسنده , , George Steiner، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Pages :
8
From page :
99
To page :
106
Abstract :
We show that every 1-tough cocomparability graph has a Hamilton cycle. This settles a conjecture of Chvàtal for the case of cocomparability graphs. Our approach is based on exploiting the close relationship of the problem to the scattering number and the path cover number.
