Biedl, ThereseThereseBiedlSchmidt, Jens M.Jens M.Schmidt2020-10-192020-10-192015-11-27International Symposium on Graph Drawing (GD 2015)http://hdl.handle.net/11420/7615It is well-known that every graph with maximum degree 4 has an orthogonal drawing with area at most 49/64 n2+O(n)≈0.76n2. In this paper, we show that if the graph is 3-connected, then the area can be reduced even further to9/16n2+O(n)≈0.56n2.Thedrawingusesthe 3-canonical order for (not necessarily planar) 3-connected graphs, which is a special Mondshein sequence and can hence be computed in linear time. To our knowledge, this is the first application of a Mondshein sequence in graph drawing.enMathematikConference Paper10.1007/978-3-319-27261-0_13Other