Pages that link to "Item:Q972337"
From MaRDI portal
The following pages link to Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337):
Displaying 10 items.
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- New characterizations of Gallai's \(i\)-triangulated graphs (Q2404384) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
