Author:
Beineke Lowell W,Little Charles H.C
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Chemins et circuits hamiltoniens des graphes complets;Camion;C. R. Acad. Sci. Paris Sér. A,1959
2. Cycles in k-strong tournaments;Goldberg;Pacific J. Math.,1972
3. M. Grötschel and F. Harary, The graphs for which all strong orientations are hamiltonian, submitted for publication.
4. The theory of round-robin tournaments;Harary;Amer. Math. Monthly,1966
5. B. Jackson, Long paths and cycles on oriented graphs, J. Graph Theory, in press.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献