• Title of article

    Stable set meeting every longest path

  • Author/Authors

    F. Havet، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2004
  • Pages
    5
  • From page
    169
  • To page
    173
  • 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
  • Serial Year
    2004
  • Journal title
    Discrete Mathematics
  • Record number

    948660

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=948660