On the problem of reconstructing a tournament from subtournaments
暂无分享,去创建一个
[1] P. Kelly. A congruence theorem for trees. , 1957 .
[2] L. Moser,et al. The Theory of Round Robin Tournaments , 1966 .
[3] L. Beineke,et al. The Maximum Number of Strongly Connected Subtournaments* , 1965, Canadian Mathematical Bulletin.
[4] Herbert Izbicki,et al. Reguläre Graphen beliebigen Grades mit vorgegebenen Eigenschaften , 1960 .
[5] S. Ulam. A collection of mathematical problems , 1960 .