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

From MaRDI portal
Revision as of 14:17, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references