The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:25, 8 February 2024
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
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
