Title of article :
Stable set meeting every longest path
Author/Authors :
F. Havet، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Abstract :
Laborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longest path. We prove that this conjecture holds for digraphs with stability number at most 2.
Keywords :
Stable set , Hamiltonian path , Longest path
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
