On the complexity of \(H\)-colouring planar graphs (Q1045065)

From MaRDI portal
Revision as of 06:54, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of \(H\)-colouring planar graphs
scientific article

    Statements

    On the complexity of \(H\)-colouring planar graphs (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    graph homomorphism
    0 references
    \(H\)-colouring
    0 references
    planar graph
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references