The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Maximum k-Colorable Subgraph Problem and Related Problems |
scientific article; zbMATH DE number 7549399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7727580666542053
0 references
0.772469699382782
0 references
0.7652110457420349
0 references
0.7644940614700317
0 references
0.7622343301773071
0 references
