Pages that link to "Item:Q4571926"
From MaRDI portal
The following pages link to On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926):
Displaying 8 items.
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710809) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- On the parameterized complexity of compact set packing (Q6623598) (← links)