Fundamentals of planar ordered sets
From MaRDI portal
If it is possible to draw in a plane a (Hasse) diagram for a finite partially ordered set using non-intersecting arcs, then it is possible to draw it using only non-intersecting stright-line segments. Proofs are of topological and combinatorial nature, and are obtained working with directed graphs.
Recommendations
- Ordered sets, pagenumbers and planarity
- Ordered sets. An introduction with connections from combinatorics to topology
- Finite ordered sets. Concepts, results and applications
- Orderings, algebras and projective planes
- scientific article; zbMATH DE number 53952
- scientific article; zbMATH DE number 432734
- scientific article; zbMATH DE number 4085656
- On the pseudodimension of ordered sets
- A theory of recursive dimension of ordered sets
- Geometric Containment and Partial Orders
Cites work
- Extending maps of plane Peano continua
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3786844 (Why is no real title available?)
- scientific article; zbMATH DE number 3544865 (Why is no real title available?)
- scientific article; zbMATH DE number 3320209 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- On the dimension of partially ordered sets
- Planar Lattices
- Planar lattices and planar graphs
Cited in
(48)- Representing orders on the plane by translating convex figures
- Algorithms for plane representations of acyclic digraphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Area requirement and symmetry display of planar upward drawings
- Drawing orders using less ink
- Lattices contained in planar orders are planar
- A note on optimal area algorithms for upward drawings of binary trees
- Advances in the theory and practice of graph drawing
- Every triangle-free planar graph has a planar upward drawing
- Edge crossings in drawings of bipartite graphs
- Planar acyclic oriented graphs
- Upward planarity testing
- On the number of upward planar orientations of maximal planar graphs
- Computing upward topological book embeddings of upward planar digraphs
- Combinatorial characterization of upward planarity
- Trapezoidal diagrams, upward triangulations, and prime Catalan numbers
- A graphical calculus for semi-groupal categories
- Upward planar graphs and their duals
- Orders with level diagrams
- Recognizing DAGs with page-number 2 is NP-complete
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- An Improved Upward Planarity Testing Algorithm and Related Applications
- Upward planar drawings on the standing and the rolling cylinders
- scientific article; zbMATH DE number 14488 (Why is no real title available?)
- scientific article; zbMATH DE number 90553 (Why is no real title available?)
- scientific article; zbMATH DE number 4127225 (Why is no real title available?)
- scientific article; zbMATH DE number 4127279 (Why is no real title available?)
- scientific article; zbMATH DE number 1264482 (Why is no real title available?)
- The Order Dimension of Planar Maps
- scientific article; zbMATH DE number 1792664 (Why is no real title available?)
- A'Campo-Gusein-Zade diagrams as partially ordered sets
- scientific article; zbMATH DE number 802721 (Why is no real title available?)
- scientific article; zbMATH DE number 887778 (Why is no real title available?)
- Upright-Quad Drawing of st-Planar Learning Spaces
- Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Universal slope sets for upward planar drawings
- Universal slope sets for upward planar drawings
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Recognizing DAGs with page-number 2 is NP-complete
- Dynamic embeddings of dynamic single-source upward planar graphs
- Drawing orders with few slopes
- Dynamic maintenance of planar digraphs, with applications
- Bipartite graphs, upward drawings, and planarity
- Maximum upward planar subgraphs of embedded planar digraphs
- Upward drawings of triconnected digraphs.
- Improving the running time of embedded upward planarity testing
This page was built for publication: Fundamentals of planar ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086596)
