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.
All Related Versions

This publication has 9 references indexed in Scilit: