Fundamentals of planar ordered sets
From MaRDI portal
Publication:1086596
DOI10.1016/0012-365X(87)90008-2zbMath0609.06002OpenAlexW2058177791MaRDI QIDQ1086596
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(87)90008-2
Partial orders, general (06A06) Planar graphs; geometric and topological aspects of graph theory (05C10) Embedding (54C25)
Related Items
Upward planarity testing, Representing orders on the plane by translating convex figures, Algorithms for plane representations of acyclic digraphs, Trapezoidal diagrams, upward triangulations, and prime Catalan numbers, Upward planar drawings on the standing and the rolling cylinders, A Sublinear Bound on the Page Number of Upward Planar Graphs, A graphical calculus for semi-groupal categories, Recognizing DAGs with page-number 2 is NP-complete, Dynamic maintenance of planar digraphs, with applications, Bipartite graphs, upward drawings, and planarity, Computing Upward Topological Book Embeddings of Upward Planar Digraphs, Representations of graphs and networks (coding, layouts and embeddings), Area requirement and symmetry display of planar upward drawings, Maximum upward planar subgraphs of embedded planar digraphs, On the number of upward planar orientations of maximal planar graphs, Upward drawings of triconnected digraphs., Computing upward topological book embeddings of upward planar digraphs, Lattices contained in planar orders are planar, A note on optimal area algorithms for upward drawings of binary trees, Universal slope sets for upward planar drawings, Improving the running time of embedded upward planarity testing, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings, An Improved Upward Planarity Testing Algorithm and Related Applications, Universal slope sets for upward planar drawings, Recognizing DAGs with page-number 2 is NP-complete, Upward planar graphs and their duals, Unnamed Item, Combinatorial characterization of upward planarity, Planar acyclic oriented graphs, Advances in the theory and practice of graph drawing, TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY, Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs, Every triangle-free planar graph has a planar upward drawing, Edge crossings in drawings of bipartite graphs
Cites Work
