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 3 items.
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs (Q6179424) (← links)