Proportional Contact Representations of 4-Connected Planar Graphs

Alam, Muhammed Jawaherul and Kobourov, Stephen G. (2013) Proportional Contact Representations of 4-Connected Planar Graphs. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 211-223(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Full text not available from this repository.

Abstract

In a contact representation of a planar graph, vertices are represented by interior-disjoint polygons and two polygons share a non-empty common boundary when the corresponding vertices are adjacent. In the weighted version, a weight is assigned to each vertex and a contact representation is called proportional if each polygon realizes an area proportional to the vertex weight. In this paper we study proportional contact representations of 4-connected internally triangulated planar graphs. The best known lower and upper bounds on the polygonal complexity for such graphs are 4 and 8, respectively. We narrow the gap between them by proving the existence of a representation with complexity 6. We then disprove a 10-year old conjecture on the existence of a Hamiltonian canonical cycle in a 4-connected maximal planar graph, which also implies that a previously suggested method for constructing proportional contact representations of complexity 6 for these graphs will not work. Finally we prove that it is NP-hard to decide whether a 4-connected planar graph admits a proportional contact representation using only rectangles.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-36763-2_19
Classifications: P Styles > P.999 Others
Z Theory > Z.500 Representations
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 21 Nov 2013 16:38
Last Modified: 24 Mar 2014 12:09
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1311

Actions (login required)

View Item View Item