Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Problem 89;Alspach;Discrete Math.,1988
2. A lower bound for the length of partial transversals in a latin square;Brouwer;Nieuw. Arch. Wisk.,1978
3. Premature sets of one-factors;Caccetta;Aust. J. Combin.,1992
4. On the existence of a matching orthogonal to a 2-factorization;Kouider;Discrete Math.,1989
5. A lower bound for the length of a partial transversal in a latin square;Shor;J. Combin. Theory Ser. A,1982
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Short Proofs of Rainbow Matchings Results;International Mathematics Research Notices;2022-07-17
2. Orthogonal matchings revisited;Discrete Mathematics;2015-11
3. A NOTE ON RAINBOW MATCHINGS;Discrete Mathematics, Algorithms and Applications;2013-12
4. Randomly orthogonal factorizations of bipartite graphs;Rocky Mountain Journal of Mathematics;2011-02-01
5. Orthogonal factorizations of digraphs;Frontiers of Mathematics in China;2009-04-03