Pages that link to "Item:Q1158444"
From MaRDI portal
The following pages link to Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444):
Displaying 9 items.
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- On balanced graphs (Q2583124) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)