Author:
Duffus Dwight,Sands Bill,Woodrow Robert
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference4 articles.
1. M. Aigner (1973) Lexicographic matching in Boolean algebras, J. Comb. Theory Series B, 14, 187?194.
2. I. J. Dejter, Hamiltonian cycles in bipartite Kneser graphs, preprint.
3. D. Duffus, P. Hanlon, and R. Roth, Matchings and Hamiltonian cycles in some families of symmetric graphs, Nokahoma Math. J., to appear.
4. H. A. Kierstead and W. T. Trotter (1988) Explicit matchings in the middle levels of the Boolean lattice, Order 5, 163?171.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献