Bihypergraph — бигиперграф.
Let and be hypergraphs with the same vertex set . An ordered pair is called a bihypergraph with the set of 0-edges and the set of 1-edges . Every hyperedge of either or is considered as a hyperedge of . The order of is . The rank of is .
A bihypergraph is called bipartite if there exists an ordered partition (bipartition) such that the set is stable in , .
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.