A New Approach for Contact Graph Representations and Its Applications
A contact graph representation is a classical graph drawing style in which vertices are represented by geometric objects such that edges correspond to contacts between objects. Based on a characterization of stretchable systems of pseudo segments, we present a new approach for constructing a wide range of contact graph representations. Using Courcelle’s theorem, some useful fixed-parameter tractability results are derived. Our approach can also be applied to giving quick proofs for some existing results of contact graph representations. We feel that the technique developed in the paper gives new insight to the study of contact representations of plane graphs.
Unable to display preview. Download preview PDF.
- 4.Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press (2012)Google Scholar
- 6.Downey, R., Fellows, M.: Fundamentals of Parameterized Complexity. Springer (2013)Google Scholar
- 12.Koebe, P.: Kontaktprobleme der konformen Abbil-dung. Ber. Verh. Sachs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse 88, 141–164 (1936)Google Scholar
- 13.Ueckerdt, T.: Geometric Representations of Graphs with low Polygonal Complexity. PhD thesis, Technische Universität Berlin (2011)Google Scholar