Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
