P503: Enumerate all maximal connected induced bipartite subgraphs in a graph

P503: Enumerate all maximal connected induced bipartite subgraphs in a graph

Input:

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

Output:

All maximal connected induced bipartite graphs in $G$.

Complexity:

$O(mn)$ delay.

Comment:

Exponential space. Proximity search.

Reference:

[Conte2019] (Bibtex)