References
L. Beineke andF. Harary: The maximum number of strongly connected subtournaments. Canad. Math. Bull.,8 (1965), 491–498.
F. Harary: On the reconstruction of a graph from a collection of subgraphs. A chapter in Graph Theory and its Applications, Prague, 1964, pp. 47–52.
F. Harary: The theory of tournaments: a miniature mathematical system. Colloq. Math.,15 (1966), 159–165.
F. Harary andL. Moser: The theory of round robin tournaments. Amer. Math. Monthly73 (1966), 231–246.
F. Harary, R. Norman, andD. Cartwright: Structural Models: an introduction to the theory of directed graphs. New York, 1965, esp. Chapter 11.
H. Izbicki: Reguläre Graphen beliebigen Grades mit vorgegebenen Eigenschaften. Monatsh. für Math.,64 (1960), 15–21.
P. J. Kelly: A congruence theorem for trees. Pacific J. Math.7 (1957), 961–968.
S. M. Ulam: A collection of mathematical problems. New York, 1960, p. 29.
Author information
Authors and Affiliations
Additional information
With 7 Figures
Work supported in part by the U. S. Air Force Office of Scientific Research under grant AF-AFOSR-754-65.
Rights and permissions
About this article
Cite this article
Harary, F., Palmer, E. On the problem of reconstructing a tournament from subtournaments. Monatshefte für Mathematik 71, 14–23 (1967). https://doi.org/10.1007/BF01299955
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01299955