The complexity of colouring by locally semicomplete digraphs (Q709314)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of colouring by locally semicomplete digraphs
scientific article

    Statements

    The complexity of colouring by locally semicomplete digraphs (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2010
    0 references
    digraph homomorphism
    0 references
    complexity
    0 references
    polynomial algorithm
    0 references
    NP-completeness
    0 references
    locally semicomplete digraphs
    0 references

    Identifiers