Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Nebeský, Ladislav. On cubes and dichotomic trees. Časopis pro pěstování matematiky, Tome 99 (1974) no. 2, pp. 164-167. doi: 10.21136/CPM.1974.117839
@article{10_21136_CPM_1974_117839,
author = {Nebesk\'y, Ladislav},
title = {On cubes and dichotomic trees},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {164--167},
year = {1974},
volume = {99},
number = {2},
doi = {10.21136/CPM.1974.117839},
mrnumber = {0354425},
zbl = {0277.05101},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1974.117839/}
}
[1] M. Behzad G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston (Мassachusetts) 1971. | MR
[2] F. Harary: Graph Theoгy. Addison-Wesley (Massachusetts) 1969. | MR
[3] I. Havel P. Liebl: O vnoření dichotomického stromu do krychle. Čas. pӗst. mat. 97 (1972), 201-205. | MR
[4] I. Havel P. Liebl: Embedding the polytomic tree into the $n$-cube. Čas. pěst. mat. 98 (1973), 307-314. | MR
[5] I. Havel J. Morávek: B-valuations of graphs. Czech. Math. Journ. 22 (1972), 338-351. | MR
[6] J. Hlavička: Race-free assignment in asynchronous switching circuits. Information Processing Machines No 13, 1967.
Cité par Sources :