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

by   Giordano Da Lozzo, et al.
University of California, Irvine

A square-contact representation of a planar graph G=(V,E) maps vertices in V to interior-disjoint axis-aligned squares in the plane and edges in E to adjacencies between the sides of the corresponding squares. In this paper, we study proper square-contact representations of planar graphs, in which any two squares are either disjoint or share infinitely many points. We characterize the partial 2-trees and the triconnected cycle-trees allowing for such representations. For partial 2-trees our characterization uses a simple forbidden subgraph whose structure forces a separating triangle in any embedding. For the triconnected cycle-trees, a subclass of the triconnected simply-nested graphs, we use a new structural decomposition for the graphs in this family, which may be of independent interest. Finally, we study square-contact representations of general triconnected simply-nested graphs with respect to their outerplanarity index.


page 7

page 9


Axis-Aligned Square Contact Representations

We introduce a new class 𝒢 of bipartite plane graphs and prove that each...

Pentagon contact representations

Representations of planar triangulations as contact graphs of a set of i...

Morphing Contact Representations of Graphs

We consider the problem of morphing between contact representations of a...

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

A plus-contact representation of a planar graph G is called c-balanced i...

Empty Squares in Arbitrary Orientation Among Points

This paper studies empty squares in arbitrary orientation among a set P ...

Approximation of trees by self-nested trees

The class of self-nested trees presents remarkable compression propertie...

Layered Area-Proportional Rectangle Contact Representations

We investigate two optimization problems on area-proportional rectangle ...

Please sign up or login with your details

Forgot password? Click here to reset