Ordered sets, pagenumbers and planarity-Reference-Cited by-同舟云学术

Ordered sets, pagenumbers and planarity

Published:1989 Issue:3 Volume:6 Page:209-218
ISSN:0167-8094
Container-title:Order
language:en
Short-container-title:Order

Author:

Nowakowski Richard,Parker Andrew

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/BF00563521.pdf

Reference12 articles.

1. M.Aigner (1979)Combinatorial Theory, Springer-Verlag, New York.

2. F.Bernhart and P. C.Kainen (1979) The book thickness of a graph,J. Combin. Theory, Ser B 27, 320?331.

3. P. Crawley and R. P. Dilworth (1973)Algebraic Theory of Lattices, Prentice-Hall.

4. F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg (1983) DIOGENES ? a methodology for designing fault-tolerant processor arrays,13th Intl. Conference on Fault-Tolerant Computing, pp. 26?32.

5. F. R. K.Chung, F. T.Leighton, and A. L.Rosenberg (1987) Embedding graphs in books: a layout problem with applications to VSLI design,SIAM J. Algebraic Methods 8, 33?58.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Directed Acyclic Outerplanar Graphs Have Constant Stack Number;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. A Sublinear Bound on the Page Number of Upward Planar Graphs;SIAM Journal on Discrete Mathematics;2023-10-12

3. Upward Book Embeddability of st-Graphs: Complexity and Algorithms;Algorithmica;2023-07-14

4. On the upward book thickness problem: Combinatorial and complexity results;European Journal of Combinatorics;2023-05

5. Recognizing DAGs with page-number 2 is NP-complete;Theoretical Computer Science;2023-02