Pages that link to "Item:Q1874371"
From MaRDI portal
The following pages link to Independent sets of maximum weight in (\(p,q\))-colorable graphs. (Q1874371):
Displaying 9 items.
- Independent sets in graphs (Q501998) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- Maximum weighted independent sets on transitive graphs and applications (Q4225377) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)