Embedding the polytomic tree into the n -cube

Ivan Havel; Petr Liebl

Časopis pro pěstování matematiky (1973)

  • Volume: 098, Issue: 3, page 307-314
  • ISSN: 0528-2195

How to cite

top

Havel, Ivan, and Liebl, Petr. "Embedding the polytomic tree into the $n$-cube." Časopis pro pěstování matematiky 098.3 (1973): 307-314. <http://eudml.org/doc/21166>.

@article{Havel1973,
author = {Havel, Ivan, Liebl, Petr},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {3},
pages = {307-314},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Embedding the polytomic tree into the $n$-cube},
url = {http://eudml.org/doc/21166},
volume = {098},
year = {1973},
}

TY - JOUR
AU - Havel, Ivan
AU - Liebl, Petr
TI - Embedding the polytomic tree into the $n$-cube
JO - Časopis pro pěstování matematiky
PY - 1973
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 098
IS - 3
SP - 307
EP - 314
LA - eng
UR - http://eudml.org/doc/21166
ER -

References

top
  1. Havel I., Liebl P., O vnoření dichotomického stromu do krychle, (Czech, English summaгy) - Čas. pӗst. mat., 97(1972), 201-205. (1972) MR0306025
  2. Havel I., Morávek J., B -valuations of graphs, Czech. Math. Jouгn., 22 (1972), 338-351. (1972) Zbl0247.05148MR0294159
  3. Berge, C, Théoгie des graphes et ses applications, Dunod, Paris 1958. (1958) MR0102822
  4. 14] Hlavička J., Race-fгee assignment in asynchronous switching circuits, Information Processing Machines No. 13, 1967. (1967) 

NotesEmbed ?

top

You must be logged in to post comments.