If a graph and its complement graph are both bipartite, then the graph has at most four vertices. Indeed, each part of a bipartition of the original graph induces a clique in the complement and therefore has at most two vertices. The bound is attained by the four-vertex path, whose complement is another four-vertex path.
Articles by others on the same topic
There are currently no matching articles.