Author:
Baier Patrick,Bosek Bartłomiej,Micek Piotr
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference7 articles.
1. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161–166 (1950)
2. Dilworth, R.P.: Some combinatorial problems on partially ordered sets. Proc. Symp. Appl. Math. 10, 85–90 (1960)
3. Felsner, S.: On-line chain partitions of orders. Theor. Comput. Sci. 175(2), 283–292 (1997). [Orders, algorithms and applications (Lyon, 1994)]
4. Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144–149 (1970)
5. Kierstead, H.A.: An effective version of Dilworths theorem. Trans. Am. Math. Soc. 268(1), 63–77 (1981)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献