Pages that link to "Item:Q2368935"
From MaRDI portal
The following pages link to On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935):
Displaying 5 items.
- Hardness of computing clique number and chromatic number for Cayley graphs (Q518185) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number (Q1799389) (← links)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)