Incidence graphs of biacyclic hypergraphs Original Research Article

It is well-known that the incidence graphs of totally balanced hypergraphs are exactly chordal bipartite graphs. This paper examines the incidence graphs of biacyclic hypergraphs. We characterize these graphs as absolute bipartite retracts with forbidden isometric wheels, or alternatively via an elimination scheme.