Pages that link to "Item:Q896848"

The following pages link to New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848):

Displaying 4 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)