The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.2021.1086 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.2021.1086 / rank | |||
Normal rank | |||
Latest revision as of 15:52, 30 December 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
0 references
0 references
0 references
0 references
0 references
0 references
