 Quasi-bipartite graph

A **quasi-bipartite graph** is a type of graph that is similar to a bipartite graph but with a relaxed condition. In a bipartite graph, the vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent. This means that edges only connect vertices from one set to those in the other set.