Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Covering with Eucliedean Boxes;Bárány;European J. Combin.,1987
2. N. Bousquet, W. Lochet, S. Thomassé, A proof of the Erdős-Sands-Sauer-Woodrow conjecture, 2017. arXiv:1703.08123v1.
3. A counterexample to a conjecture on edge coloured tournaments;Galeana-Sánchez;Discrete Math.,2004
4. Absorbing sets in arc-coloured tournaments;Hahn;Discrete Math.,2004
5. On monochromatic paths in m-coloured tournaments;Minggang;J. Combin. Theory Ser. B,1988
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献