On the $(m,n)$-basis of a digraph
Mathematica slovaca, Tome 30 (1980) no. 4, pp. 401-404
@article{MASLO_1980_30_4_a8,
author = {Harminc, Mat\'u\v{s}},
title = {On the $(m,n)$-basis of a digraph},
journal = {Mathematica slovaca},
pages = {401--404},
year = {1980},
volume = {30},
number = {4},
mrnumber = {595301},
zbl = {0452.05028},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1980_30_4_a8/}
}
Harminc, Matúš. On the $(m,n)$-basis of a digraph. Mathematica slovaca, Tome 30 (1980) no. 4, pp. 401-404. http://geodesic.mathdoc.fr/item/MASLO_1980_30_4_a8/
[1] BEHZAD M., HARARY F.: Which directed graphs have a solution?. Math. Slovaca 27, 1977, 37-42. | MR | Zbl
[4] BERGE C.: Graphs and hypergraphs. Nort-Holland, Amsterdam 1973. | MR | Zbl
[3] HARARY F.: Graph theory. Addison-Wesley, Reading, Mass. 1969. | MR | Zbl
[4] HARARY F., NORMAN R. Z., CARTWRIGHT D.: Structural models. Wiley, New York 1965. | MR | Zbl
[5] von NEUMANN J., MORGENSTERN O.: Theory of games and economic behavior. Princeton University Press, Princeton 1944. | MR | Zbl
[6] RICHARDSON M.: On weakly ordered systems. Bull. Amer. Math. Soc., 52, 1946, 113-116. | MR | Zbl