Algorithms for finding in the lump both bounds of the chromatic number of a graph (Q4109290)

From MaRDI portal
Revision as of 21:06, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3532517
Language Label Description Also known as
English
Algorithms for finding in the lump both bounds of the chromatic number of a graph
scientific article; zbMATH DE number 3532517

    Statements

    Algorithms for finding in the lump both bounds of the chromatic number of a graph (English)
    0 references
    1976
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references