Bipartite graphs, upward drawings, and planarity
- 15 December 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 36 (6) , 317-322
- https://doi.org/10.1016/0020-0190(90)90045-y
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Area requirement and symmetry display in drawing graphsPublished by Association for Computing Machinery (ACM) ,1989
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Representing orders on the plane by translating convex figuresOrder, 1988
- Hierarchies and planarity theoryIEEE Transactions on Systems, Man, and Cybernetics, 1988
- Fundamentals of planar ordered setsDiscrete Mathematics, 1987
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Planar lattices and planar graphsJournal of Combinatorial Theory, Series B, 1976
- Planar LatticesCanadian Journal of Mathematics, 1975
- Efficient Planarity TestingJournal of the ACM, 1974