P380: Enumeration of all maximal independent sets in a claw-free graph

P380: Enumeration of all maximal independent sets in a claw-free graph

Input:

A claw-free graph $G$.

Output:

All maximal independent sets in $G$.

Complexity:

Comment:

Reference:

[Minty1980] (Bibtex)