New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848)
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: New bounds for the -k-cut and chromatic number of a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8446522355079651
0 references
0.8040570020675659
0 references
0.8028625249862671
0 references
