Pages that link to "Item:Q976121"
From MaRDI portal
The following pages link to Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121):
Displaying 5 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- Improved Inapproximability Results for Maximum k-Colorable Subgraph (Q3638876) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)