A characterization of hypergraphs generated by arborescences
Kybernetika, Tome 15 (1979) no. 6, pp. 403-407
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1979_15_6_a0,
author = {Sys{\l}o, Maciej M.},
title = {A characterization of hypergraphs generated by arborescences},
journal = {Kybernetika},
pages = {403--407},
year = {1979},
volume = {15},
number = {6},
mrnumber = {562372},
zbl = {0423.05031},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1979_15_6_a0/}
}
Sysło, Maciej M. A characterization of hypergraphs generated by arborescences. Kybernetika, Tome 15 (1979) no. 6, pp. 403-407. http://geodesic.mathdoc.fr/item/KYB_1979_15_6_a0/
[1] C. Berge: Graphs and hypergraphs. North-Holland, Amer. Elsevier, Amsterdam 1973. | MR | Zbl
[2] M. Karoński Z. Palka: On Marczewski-Steinhaus type distance between hypergraphs. Zastosow. Matem. 16 (1977), 47-57. | MR
[3] D. E. Knuth: The art of computer programming. Vol. 1: Fundamental algorithms. Reading (Mass.) 1968, 309. | MR | Zbl