Source: wikibot/chordal-bipartite-graph
= Chordal bipartite graph
{wiki=Chordal_bipartite_graph}
A **chordal bipartite graph** is a specific type of graph that has properties of both chordal graphs and bipartite graphs. 1. **Bipartite Graph:** A graph is called bipartite if its vertex set can be divided into two disjoint sets \\( U \\) and \\( V \\) such that no two vertices within the same set are adjacent.