Monotone drawings of graphs with few directions

A monotone drawing of a graph is a straight-line planar drawing such that every pair of vertices is connected by a path that monotonically increases with respect to a direction. However, different pairs of vertices might use different directions of monotonicity. In this paper we aim at constructing monotone drawings in which the number of different directions of monotonicity used by all the pairs of vertices is small. We show that a planar graph admits a monotone drawing with only one direction of monotonicity if and only if it is Hamiltonian. Also, we prove that maximal planar graphs admit monotone drawings with two (orthogonal) directions, while triconnected planar graphs with three directions. The latter two results are obtained by applying the famous drawing algorithm by Schnyder.

[1]  Ioannis G. Tollis,et al.  Area requirement and symmetry display of planar upward drawings , 1992, Discret. Comput. Geom..

[2]  Raghavan Dhandapani,et al.  Greedy Drawings of Triangulations , 2008, SODA '08.

[3]  Antonios Symvonis,et al.  Monotone Drawings of Graphs with Fixed Embedding , 2013, Algorithmica.

[4]  Alexander Wolff,et al.  On Monotone Drawings of Trees , 2014, Graph Drawing.

[5]  Martin Nöllenburg,et al.  Euclidean Greedy Drawings of Trees , 2013, ESA.

[6]  Christos H. Papadimitriou,et al.  On a conjecture related to geometric routing , 2004, Theor. Comput. Sci..

[7]  Martin Nöllenburg,et al.  On self-approaching and increasing-chord drawings of 3-connected planar graphs , 2016, J. Comput. Geom..

[8]  Timothy M. Chan,et al.  Self-approaching Graphs , 2012, Graph Drawing.

[9]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[10]  Roberto Tamassia,et al.  Output-Sensitive Reporting of Disjoint Paths , 1996, Algorithmica.

[11]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[12]  Ôôöøøøøóò Óó,et al.  Strictly Convex Drawings of Planar Graphs , 2022 .

[13]  Xin He,et al.  Optimal Monotone Drawings of Trees , 2016, SIAM J. Discret. Math..

[14]  Patrizio Angelini.  Monotone drawings of graphs with few directions , 2015, IISA.

[15]  Stefan Felsner,et al.  Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.

[16]  Emilio Di Giacomo,et al.  Lower and upper bounds for long induced paths in 3-connected planar graphs , 2016, Theor. Comput. Sci..

[17]  Joachim Gudmundsson,et al.  Increasing-Chord Graphs On Point Sets , 2015, J. Graph Algorithms Appl..

[18]  Md. Iqbal Hossain,et al.  Monotone Grid Drawings of Planar Graphs , 2014, FAW.

[19]  Esther M. Arkin,et al.  On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.

[20]  Md. Iqbal Hossain,et al.  Good spanning trees in graph drawing , 2015, Theor. Comput. Sci..

[21]  Weidong Huang,et al.  A graph reading behavior: Geodesic-path tendency , 2009, 2009 IEEE Pacific Visualization Symposium.

[22]  Frank Thomson Leighton,et al.  Some Results on Greedy Embeddings in Metric Spaces , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[23]  Günter Rote.  Strictly convex drawings of planar graphs , 2005, SODA.

[24]  Xin He,et al.  Monotone Drawings of 3-Connected Plane Graphs , 2015, ESA.

[25]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[26]  Stefan Felsner,et al.  Strongly Monotone Drawings of Planar Graphs , 2016, Symposium on Computational Geometry.

[27]  W. Schnyder.  Planar graphs and poset dimension , 1989 .