DeepAI AI Chat
Log In Sign Up

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings

by   Therese Biedl, et al.
University of Saskatchewan
University of Waterloo

A plus-contact representation of a planar graph G is called c-balanced if for every plus shape +_v, the number of other plus shapes incident to each arm of +_v is at most c Δ +O(1), where Δ is the maximum degree of G. Although small values of c have been achieved for a few subclasses of planar graphs (e.g., 2- and 3-trees), it is unknown whether c-balanced representations with c<1 exist for arbitrary planar graphs. In this paper we compute (1/2)-balanced plus-contact representations for all planar graphs that admit a rectangular dual. Our result implies that any graph with a rectangular dual has a 1-bend box-orthogonal drawings such that for each vertex v, the box representing v is a square of side length deg(v)/2+ O(1).


A note on 1-planar graphs with minimum degree 7

It is well-known that 1-planar graphs have minimum degree at most 7, and...

Vertex partitions of (C_3,C_4,C_6)-free planar graphs

A graph is (k_1,k_2)-colorable if its vertex set can be partitioned into...

Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs

A square-contact representation of a planar graph G=(V,E) maps vertices ...

Decomposing 4-connected planar triangulations into two trees and one path

Refining a classical proof of Whitney, we show that any 4-connected plan...

Optimal Morphs of Planar Orthogonal Drawings II

Van Goethem and Verbeek recently showed how to morph between two planar ...

Precision QCD corrections to gluon-initiated diphoton-plus-jet production at the LHC

In this thesis, we present recent advances at the precision frontier of ...