Pages that link to "Item:Q724231"
From MaRDI portal
The following pages link to Approximability of clique transversal in perfect graphs (Q724231):
Displaying 7 items.
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (Q2059196) (← links)
- Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs (Q2921429) (← links)
- Optimal‐size clique transversals in chordal graphs (Q4646950) (← links)