This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
No issues specified. Please specify issues, or remove this template. |
In graph theory, a BF-graph is an oriented hypergraph where each hyper-arc is either a B-arc or a F-arc. A B-arc is a hyperarc with a head of size 1 and a F-arc is a hyperarc with a tail of size 1. A hypergraph with only B-arcs is a B-graph and a hypergraph with only F-arcs is a F-graph.
Bibliography
G. Gallo, G.Longo, S. Nguyen and S. Pallottino (1993). Directed hypergraphs and applications. Vol. 42. pp. 177–201. {{cite book}}: |journal= ignored (help)CS1 maint: multiple names: authors list (link)
S. Nguyen, D. Pretolani and L. Markenson (1998). On Some Path Problems on Oriented Hypergraphs. Vol. 32. pp. 1–20. {{cite book}}: |journal= ignored (help)