Pages that link to "Item:Q896848"
From MaRDI portal
The following pages link to New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848):
Displayed 10 items.
- Max \(k\)-cut and the smallest eigenvalue (Q286169) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters (Q1791705) (← links)
- Hamming graphs and special LCD codes (Q2008071) (← links)
- On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs (Q2115142) (← links)
- Eigenvalues of Cayley graphs (Q2138565) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)