An independent set of a graph is a subset of pairwise non-adjacent vertices. A complete
bipartite set B is a subset of vertices admitting a bipartition B= X∪ Y, such that both X and Y
are independent sets, and all vertices of X are adjacent to those of Y. If both X, Y≠∅, then B
is called proper. A biclique is a maximal proper complete bipartite set of a graph. When the
requirement that X and Y are independent sets of G is dropped, we have a non-induced
biclique. We show that it is NP-complete to test whether a subset of the vertices of a graph is …

Generating all configurations that satisfy a given specification is a well-studied problem in
Combinatorics and in Graph theory suggesting many interesting problems. Among them,
generating all maximal independent sets of a given graph is one that has attracted
considerable attention [3, 4, 7]. A maximal independent set of a graph G=(V, E) is a subset
V⊆ V such that no two vertices in V are adjacent by an edge in E, and such that each vertex
in V− V is adjacent to some vertex in V. Let s1,..., s| S| and t1,..., t| T| be two distinct …