Pages that link to "Item:Q3191580"
From MaRDI portal
The following pages link to Improved inapproximability results for maximum \(k\)-colorable subgraph (Q3191580):
Displaying 6 items.
- The maximum binary tree problem (Q2041978) (← links)
- Improved Inapproximability Results for Maximum k-Colorable Subgraph (Q3638876) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- (Q6176154) (← links)