论文信息 - On Page Number of N-free Posets

On Page Number of N-free Posets

Abstract In this paper we deal with the page number of partially ordered sets (posets). In particular, we find the page number of some N -free posets whose root graphs form a family of planar posets with known page number.

Maciej M. Syslo | Anna Beata Kwiatkowska

[1] Arnold L. Rosenberg,et al. Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[2] Paul C. Kainen,et al. The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[3] Maciej M. Syslo,et al. A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph , 1982, Inf. Process. Lett..

[4] I. Rival. Algorithms and Order , 1988 .

[5] Mihalis Yannakais,et al. Embedding planar graphs in four pages , 1989, STOC 1989.

[6] B. Monjardet,et al. Ordres "C.A.C." , 1973 .

[7] Maciej M. Syslo. Optimal constructions of reversible digraphs , 1984, Discret. Appl. Math..

[8] P. A. Grillet. Maximal chains and antichains , 1969 .

[9] Maciej M. Syslo,et al. On Posets of Page Number 2 , 2005, Electron. Notes Discret. Math..

[10] Mihalis Yannakakis,et al. Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.

[11] Maciej M. Syslo,et al. Bounds to the Page Number of Partially Ordered Sets , 1990, WG.

[12] Richard J. Nowakowski,et al. Ordered sets, pagenumbers and planarity , 1989 .