Series-parallel planar ordered sets have pagenumber two

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1190, Issue , 1997, Pages 11-24

  Alzohairi, Mohammad ^a   Rival, Ivan ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

ORDERED SET; PAGE-NUMBER; SERIES-PARALLEL;

SET THEORY;

EID: 84957635331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_34     Document Type: Conference Paper

References (11)

1. F. Bernhart and P. C. Kainen (1979) The book thickness of a graph, Journal of Combinatorial Theory, Series B 27, 320-331.
2. G. Birkhoff (1967) Lattice Theory, American Mathematical Society, Providence, Rhode Island.
3. L. T. Q. Hung (1993) A Planar Poset which Requires four Pages, Ars Cornbin 35, 291-302
4. H. de Fraysseix, P. O. de Mendez and J. Pach (1995) A Left Search Algorithm for Planar Graphs, Discrete Comput. Geom. 13, 459-468.
5. D. Kelly and I. Rival (1975) Planar lattices, Canad. Journal of Mathematics 27, 636-665.
6. H. M. MacNeille (1937) Partially ordered sets, Trans. Amer. Math. Soc. 42, 416-460.
7. R. Nowakowski and A. Parker (1989), Ordered sets, pagenumbers and planarity, Order 6, 209-218.
8. S. V. Pemmaraju (1992) Exploring the Powers of Stacks and Queues via Graph Layouts, Ph.D. thesis, Virginia Polytechnic Institute and State University at Blacksburg, Virginia.
9. M. M. Systo (1990) Bounds to the Page Number of Partially Ordered Sets, Graph-theoretic concepts in computer science (Kerkrade, 1989), 181-195, Lecture Notes in Comput. Sci. 411. Springer, Berlin.
10. J. Valdes, R. E. Tarjan and E. L. Lawler (1982) The recognition of seriesparallel digraphs, SIAM J. Computing 11, 298-314.
11. M. Yannakakis (1989) Embedding planar graphs in four pages, J. Comput. System Sci. 38, 36-67.