Pages that link to "Item:Q1159467"

The following pages link to A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467):

Displaying 3 items.

• Claw-free graphs---a survey (Q1356695) (← links)
• Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
• A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)