New proofs for strongly chordal graphs and chordal bipartite graphs

Abstract

We give new proofs of well-known characterizations of strongly chordal graphs and chordal bipartite graphs. The key ingredient is the dual hypertree structure for totally balanced hypergraphs. We also consider split graphs and threshold graphs