A **bivariegated graph** is a specific type of graph in which the vertex set can be divided into two distinct sets such that no two vertices within the same set are adjacent. This means that every edge connects a vertex from one set to a vertex from the other set. In essence, a bivariegated graph is a bipartite graph.
New to topics? Read the docs here!