Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. N. Alon and S. Friedland: The maximum number of perfect machings in graphs with a given degree sequence, Elec. J. Combinatorics 15 (2008), #N13.
2. L. Brégman: Some properties of nonnegative matrices and their permanents, Math. Doklady 14 (1973), 945–949.
3. F. R. K. Chung, P. Frankl, R. Graham and J. B. Shearer: Some intersection theorems for ordered sets and graphs, J. Combin. Theory Ser. A 48 (1986), 23–37.
4. I. Csiszár and J. Körner: Information theory. Coding theorems for discrete memoryless systems; Akadémiai Kiadó, Budapest, 1981.
5. B. Cuckler: Hamiltonian cycles in regular tournaments and Dirac graphs, Ph.D. thesis, Rutgers University, 2006.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献