The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675)

From MaRDI portal
Revision as of 11:14, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7549399
Language Label Description Also known as
English
The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems
scientific article; zbMATH DE number 7549399

    Statements

    The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    \(k\)-colorable subgraph problem
    0 references
    stable set
    0 references
    chromatic number of a graph
    0 references
    generalized theta number
    0 references
    semidefinite programming
    0 references
    Johnson graphs
    0 references
    Hamming graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers