1 Answers
In the mathematical area of graph theory, a chordal bipartite graph is a bipartite graph B = in which every cycle of length at least 6 in B has a chord, i.e., an edge that connects two vertices that are a distance > 1 apart from each other in the cycle.A better name would be weakly chordal and bipartite since chordal bipartite graphs are in general not chordal as the induced cycle of length 4 shows.
5 views
Answered