Pages that link to "Item:Q1755775"
From MaRDI portal
The following pages link to Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775):
Displaying 6 items.
- On the maximum \(q\)-colourable induced subgraph problem in perfect graphs (Q964478) (← links)
- Independent sets of maximum weight in (\(p,q\))-colorable graphs. (Q1874371) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)