Title of article
Incidence graphs of biacyclic hypergraphs Original Research Article
Author/Authors
Feodor F. Dragan، نويسنده , , Vitaly I. Voloshin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
8
From page
259
To page
266
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.
Keywords
Absolute bipartite retract , Maximum neighbourhood ordering , Chordal bipartite graph , Acyclic hypergraph , Incidence graph
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884409
Link To Document