Between 2- and 3-colorability (Q5902303)

From MaRDI portal
Revision as of 06:38, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5642338
Language Label Description Also known as
English
Between 2- and 3-colorability
scientific article; zbMATH DE number 5642338

    Statements

    Between 2- and 3-colorability (English)
    0 references
    0 references
    4 December 2009
    0 references
    0 references
    3-colorability
    0 references
    polynomial-time algorithm
    0 references
    hereditary class of graphs
    0 references
    computational complexity
    0 references
    0 references