Pages that link to "Item:Q2368935"

The following pages link to On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935):

Displaying 3 items.

• Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
• Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
• Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)