New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Biq Mac / rank | |||
Normal rank | |||
Revision as of 18:41, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph |
scientific article |
Statements
New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (English)
0 references
14 December 2015
0 references
\(\max\)-\(k\)-cut
0 references
chromatic number
0 references
semidefinite programming
0 references
Laplacian eigenvalues
0 references
walk-regular graphs
0 references
association schemes
0 references
strongly regular graphs
0 references
Hamming graphs
0 references
