Bipartite graphs, upward drawings, and planarity
From MaRDI portal
Publication:918730
DOI10.1016/0020-0190(90)90045-YzbMath0706.68081MaRDI QIDQ918730
Giuseppe Di Battista, Ivan Rival, Wei-Ping Liu
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Planar posets, dimension, breadth and the number of minimal elements, A left-first search algorithm for planar graphs, How to draw a series-parallel digraph, Upward planarity testing, Tree-width and dimension, Synchronized Planarity with Applications to Constrained Planarity Problems, ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS, Embedding graphs into embedded graphs, The queue-number of posets of bounded width or height, Order, genus, and diagram invariance, Area requirement and symmetry display of planar upward drawings, Upward drawings of triconnected digraphs., A note on optimal area algorithms for upward drawings of binary trees, Dimension and height for posets with planar cover graphs., On the upward embedding on the torus, Upward Planarity Testing in Practice, Obituary: Ivan Rival, Every triangle-free planar graph has a planar upward drawing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of planar ordered sets
- Representing orders on the plane by translating convex figures
- Algorithms for plane representations of acyclic digraphs
- Lattices contained in planar orders are planar
- Planar graphs: Theory and algorithms
- The dimension of planar posets
- Planar lattices and planar graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incremental convex planarity testing
- Hierarchies and planarity theory
- A Depth-First-Search Characterization of Planarity
- Efficient Planarity Testing
- Planar Lattices
