Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. L. Beineke andF. Harary: The maximum number of strongly connected subtournaments. Canad. Math. Bull.,8 (1965), 491?498.
2. 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.
3. F. Harary: The theory of tournaments: a miniature mathematical system. Colloq. Math.,15 (1966), 159?165.
4. F. Harary andL. Moser: The theory of round robin tournaments. Amer. Math. Monthly73 (1966), 231?246.
5. F. Harary, R. Norman, andD. Cartwright: Structural Models: an introduction to the theory of directed graphs. New York, 1965, esp. Chapter 11.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Graphs, Orders, Infinites and Philosophy;2023-03-31
2. Are all pairs of hypomorphic digraphs S-isomorphic?;Discrete Applied Mathematics;2021-08
3. Realization problems on reachability sequences;Theoretical Computer Science;2021-04
4. The {-2,-1}-selfdual and decomposable tournaments;Discussiones Mathematicae Graph Theory;2018
5. The Reconstruction Problem;Discrete Mathematics and Its Applications;2013-11-26