• Title of article

    The complexity of colouring by locally semicomplete digraphs

  • Author/Authors

    Bang-Jensen، نويسنده , , Jّrgen and MacGillivray، نويسنده , , Gary and Swarts، نويسنده , , Jacobus، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2010
  • Pages
    10
  • From page
    2675
  • To page
    2684
  • Abstract
    In this paper we establish a dichotomy theorem for the complexity of homomorphisms to fixed locally semicomplete digraphs. It is also shown that the same dichotomy holds for list homomorphisms. The polynomial algorithms follow from a different, shorter proof of a result by Gutjahr, Welzl and Woeginger.
  • Keywords
    Locally semicomplete digraphs , Digraph homomorphism , Complexity , NP-Completeness , Polynomial algorithm
  • Journal title
    Discrete Mathematics
  • Serial Year
    2010
  • Journal title
    Discrete Mathematics
  • Record number

    1599421

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