Pages that link to "Item:Q1041408"

The following pages link to Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (Q1041408):

Displayed 1 item.

• A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) ‎ (← links)