A plane Hasse representation of an acyclic oriented graph is a drawing of the graph in the Euchdean plane such that all arcs are straight-line segments directed upwards and such that no two arcs cross. We characterize completely those oriented graphs which have a plane Hasse representation such that
A Characterization of Planar Oriented Graphs
β Scribed by Ulrich, John Wade
- Book ID
- 118190781
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1970
- Tongue
- English
- Weight
- 832 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0036-1399
- DOI
- 10.1137/0118030
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is &own that every rnzknal plsnar graph Itriangulakn) can be contracted at an arbitrary point (by identifying it with an adjacent point) c,o that triangularity is preserved. This is used as B lemma to prove that every triangulation con be (a) oriented so that with threg: exceptions every point hs
The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi