P452: Enumerate all maximal 6-colorable subgraph in a graph.

P452: Enumerate all maximal 6-colorable subgraph in a graph.

Input:

A graph $G = (V, E)$.

Output:

All maximal 6-colorable subgraphs in $G$.

Complexity:

$O(2.2680^{|V|})$ total time and $O(2^{|V|})$ space.

Comment:

Reference:

[Byskov2004] (Bibtex)