The minimum size of 2-connected chordal bipartite graphs
arXiv:2410.20810
Abstract
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.
9 pages.3 figures