The minimum size of 2-connected chordal bipartite graphs
Licheng Zhang, Yuanqiu Huang·2024-10-28·via math.CO updates on arXiv.org
A bipartite graph is chordal bipartite if every cycle of length at least six contains a chord. We determine the minimum size in 2-connected chordal bipartite graphs with given order.