A unified approach to visibility representations of planar graphs
Open Access
- 1 December 1986
- journal article
- Published by Springer Science and Business Media LLC in Discrete & Computational Geometry
- Vol. 1 (4), 321-341
- https://doi.org/10.1007/bf02187705
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- Characterizing bar line-of-sight graphsPublished by Association for Computing Machinery (ACM) ,1985
- On minimal‐node‐cost planar embeddingsNetworks, 1984
- Representing a planar graph by vertical lines joining different levelsDiscrete Mathematics, 1983
- The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar GraphsSIAM Journal on Computing, 1982
- Computing an st-numberingTheoretical Computer Science, 1976
- Graph Theory with ApplicationsPublished by Springer Science and Business Media LLC ,1976
- Efficient Planarity TestingJournal of the ACM, 1974
- A theorem on planar graphsTransactions of the American Mathematical Society, 1956