Skip to main content
SpringerLink
Log in

Planar acyclic oriented graphs

  • Published:
Order Aims and scope Submit manuscript

Abstract

A plane Hasse representation of an acyclic oriented graph is a drawing of the graph in the Euclidean 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 all faces are bounded by convex polygons. From this we derive the Hasse representation analogue, due to Kelly and Rival of Fary's theorem on straight-line representations of planar graphs and the Kuratowski type theorem of Platt for acyclic oriented graphs with only one source and one sink. Finally, we describe completely those acyclic oriented graphs which have a vertex dominating all other vertices and which have no plane Hasse representation, a problem posed by Trotter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Grünbaum (1969) Convex Polytopes, John Wiley, New York.

    Google Scholar 

  2. B. Grünbaum and G. C. Shephard (1981) The geometry of planar graphs, Proc. Eighth British Combinatorial Conf., pp. 124–150.

  3. D. Kelly (1987) Fundamentals of planar ordered sets, Discrete Math. 63, 197–216.

    Google Scholar 

  4. D. Kelly and I. Rival (1975) Planar lattices, Can. J. Math. 27, 636–665.

    Google Scholar 

  5. J. Nesetril (1985) Complexity of diagrams, preprint, Charles Univ., Prague.

    Google Scholar 

  6. C. R. Platt (1976) Planar lattices and planar graphs, J. Combin. Theory B21, 30–39.

    Google Scholar 

  7. C. Thomassen (1980) Planarity and duality of finite and infinite graphs, J. Combin. Theory B29, 244–271.

    Google Scholar 

  8. C. Thomassen (1984) Plane representations of graphs, in Progress in Graph Theory (J. A. Bondy and U. S. R. Murty eds.), Academic Press, New York, pp. 43–69.

    Google Scholar 

  9. W. T. Trotter (1983) Graphs and partially ordered sets, in Selected Topics in Graph Theory 2 (L. W. Beineke and R. J. Wilson, eds.), Academic Press, New York, pp. 237–268.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, The Technical University of Denmark, Building 303, DK-2800, Lyngby, Denmark

    Carsten Thomassen

Authors
  1. Carsten Thomassen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by W. T. Trotter

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thomassen, C. Planar acyclic oriented graphs. Order 5, 349–361 (1989). https://doi.org/10.1007/BF00353654

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00353654

AMS subject classifications (1980)

Key words

Search

Navigation