Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286)

From MaRDI portal
Revision as of 09:53, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7204403
Language Label Description Also known as
English
Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
scientific article; zbMATH DE number 7204403

    Statements

    0 references
    26 May 2020
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references
    graph partition
    0 references
    colouring
    0 references
    homomorphism
    0 references
    retraction
    0 references
    compaction
    0 references
    vertex-compaction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (English)
    0 references

    Identifiers

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