The complexity of some graph colouring problems

    Research output: Contribution to journalArticle

    3 Citations (Scopus)
    Original languageEnglish
    Pages (from-to)131-140
    Number of pages10
    JournalDiscrete Applied Mathematics
    Volume36
    Issue number2
    Publication statusPublished - 1992

    Cite this

    @article{f3dd7d5a3bed40089b4b8511815be981,
    title = "The complexity of some graph colouring problems",
    author = "K. Edwards",
    note = "Copyright 2008 Elsevier B.V., All rights reserved.",
    year = "1992",
    language = "English",
    volume = "36",
    pages = "131--140",
    journal = "Discrete Applied Mathematics",
    issn = "0166-218X",
    publisher = "Elsevier",
    number = "2",

    }

    The complexity of some graph colouring problems. / Edwards, K.

    In: Discrete Applied Mathematics, Vol. 36, No. 2, 1992, p. 131-140.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - The complexity of some graph colouring problems

    AU - Edwards, K.

    N1 - Copyright 2008 Elsevier B.V., All rights reserved.

    PY - 1992

    Y1 - 1992

    UR - http://www.scopus.com/inward/record.url?scp=38249011331&partnerID=8YFLogxK

    M3 - Article

    VL - 36

    SP - 131

    EP - 140

    JO - Discrete Applied Mathematics

    JF - Discrete Applied Mathematics

    SN - 0166-218X

    IS - 2

    ER -