Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference14 articles.
1. V. Bouchitte, M. Habib, M. Hamroun, and R. Jegou (1986) Depth first search and linear extensions, preprint.
2. O.Cogis (1982) Problem 4.6 in Ordered Sets (ed. I.Rival), D. Reidel, Dordrecht, p. 814.
3. O.Cogis and M.Habib (1979) Nombre de sauts et graphes série-parallèles, R.A.I.R.O. Inf. Th. 13, 1, pp. 3–18.
4. S. A. Cook (1971) The complexity of theorem-proving procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing, Association of Computing Machinery, New York, pp. 151–158.
5. M. H.El-Zahar and J. H.Schmerl (1984) On the size of jump-critical ordered sets, Order 1, 3–5.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献