Pages that link to "Item:Q2864316"
From MaRDI portal
The following pages link to Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316):
Displaying 9 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- On the maximum \(q\)-colourable induced subgraph problem in perfect graphs (Q964478) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← 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)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Linear-Time Generation of Random Chordal Graphs (Q5283388) (← links)
- Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)