1. The permutahedron of N-sparse posets;von Arnim;Math. Programming Ser. A,1996
2. L. Babel, S. Olariu, On the p-connectedness of graphs — a survey, Discrete Appl. Math., to appear.
3. E. Dahlhaus, J. Gustedt, R. McConnell, A practical and efficient algorithm for substitution decomposition, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New Orleans, LA, 1997, pp. 26–35.
4. Interval orders without odd crowns are defect optimal;Faigle;Computing,1987
5. P4-reducible graphs — a class of uniquely tree-representable graphs;Jamison;Stud. Appl. Math.,1989