A topological lower bound for the chromatic number of a special family of graphs (Q1686007)

From MaRDI portal
Revision as of 21:52, 14 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
A topological lower bound for the chromatic number of a special family of graphs
scientific article

    Statements

    A topological lower bound for the chromatic number of a special family of graphs (English)
    0 references
    20 December 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    Hom complex
    0 references
    graph homomorphism
    0 references
    test graph
    0 references
    0 references
    0 references