The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724)

From MaRDI portal
Revision as of 18:00, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
scientific article

    Statements

    The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (English)
    0 references
    0 references
    22 November 2019
    0 references
    graph tessellation cover
    0 references
    graph coloring
    0 references
    clique graph
    0 references
    staggered quantum walk
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references