A characterization of hypergraphs generated by arborescences

Previous | Up | Next

Article

A characterization of hypergraphs generated by arborescences. (English). Kybernetika, vol. 15 (1979), issue 6, pp. (403)-407

MSC: 05C05, 05C65, 68E10 | MR 562372 | Zbl 0423.05031

References:

[1] C. Berge: Graphs and hypergraphs. North-Holland, Amer. Elsevier, Amsterdam 1973. MR 0357172 | Zbl 0254.05101

[2] M. Karoński Z. Palka: On Marczewski-Steinhaus type distance between hypergraphs. Zastosow. Matem. 16 (1977), 47-57. MR 0476583

[3] D. E. Knuth: The art of computer programming. Vol. 1: Fundamental algorithms. Reading (Mass.) 1968, 309. MR 0378456 | Zbl 0191.17903

Partner of