Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory,Discrete Mathematics and Combinatorics
Reference50 articles.
1. Behrendt, B.: Maximal antichains in partially ordered sets. Ars Comb. 25C, 149–157 (1988)
2. Birkhoff, G.: Lattice theory. Am. Math. Soc. 25(3), (1967)
3. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes, a survey. SIAM Monogr. Discret. Math. Appl. (1999)
4. Caspard, N., Leclerc, B., Monjardet, B.: Finite Ordered Sets Concepts, Results and Uses. Cambridge University Press (2012)
5. Corneil, D.G., Dalton, B., Habib, M.: LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs. SIAM J. Comput. 42(3), 792–807 (2013)