论文信息 - Bounds to the Page Number of Partially Ordered Sets

Bounds to the Page Number of Partially Ordered Sets

In this paper we initiate study of a new poset invariant, the page number, well-known for graphs. Lower and upper bounds are derived and then they are used to evaluate and to bound the exact value of the page number for some families of posets. Several problems are posed.

Maciej M. Syslo | M. Syslo

[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] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[4] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[5] David Kelly. Fundamentals of planar ordered sets , 1987, Discret. Math..

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

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

[8] Rolf H. Möhring,et al. Computing the bump number is easy , 1988 .

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