Shortcuts, diversions, and maximal chainsin partially ordered sets
- 31 March 1973
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 4 (3), 287-293
- https://doi.org/10.1016/s0012-365x(73)80007-x
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- On the foundations of combinatorial theory I. Theory of M bius FunctionsProbability Theory and Related Fields, 1964