On Geometric Drawings of Graphs
Abstract
This thesis is about geometric drawings of graphs and their topological generalizations.
First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing is one in which every edge can be extended into an infinite simple arc in the plane, homeomorphic to $\mathbb{R}$, and such that every two extending arcs cross exactly once. This is a natural generalization of the well-studied class of rectilinear drawings, where edges are straight-line segments. Although, the problem of deciding whether a drawing is homeomorphic to a rectilinear drawing is NP-hard, in this work we characterize the minimal forbidden subdrawings for pseudolinear drawings and we also provide a polynomial-time algorithm for recognizing this family of drawings.
Second, we consider the problem of transforming a topological drawing into a similar rectilinear drawing preserving the set of crossing pairs of edges. We show that, under some circumstances, pseudolinearity is a necessary and sufficient condition for the existence of such transformation. For this, we prove a generalization of Tutte's Spring Theorem for drawings with crossings placed
in a particular way.
Lastly, we study drawings of $K_n$ in the sphere whose edges can be extended to an arrangement of pseudocircles. An arrangement of pseudocircles is a set of simple closed curves in the sphere such that every two intersect at most twice. We show that (i) there is drawing of $K_{10}$ that cannot be extended into an arrangement of pseudocircles; and (ii) there is a drawing of $K_9$ that can be extended to an arrangement of pseudocircles, but no extension satisfies that every two pseudocircles intersects exactly twice. We also introduce the notion pseudospherical drawings of $K_n$, a generalization of spherical drawings in which each edge is a minor arc of a great circle. We show that these drawings are characterized by a simple local property. We also show that every pseudospherical drawing has an extension into an arrangement of pseudocircles where the ``at most twice'' condition is replaced by ``exactly twice''.
Collections
Cite this version of the work
Alan Marcelo Arroyo Guevara
(2018).
On Geometric Drawings of Graphs. UWSpace.
http://hdl.handle.net/10012/13103
Other formats
Related items
Showing items related by title, author, creator and subject.
-
Simultaneous Graph Representation Problems
Jampani, Krishnam Raju (University of Waterloo, 2011-02-18)Many graphs arising in practice can be represented in a concise and intuitive way that conveys their structure. For example: A planar graph can be represented in the plane with points for vertices and non-crossing curves ... -
Software Architecture Recovery based on Pattern Matching
Sartipi, Kamran (University of Waterloo, 2003)Pattern matching approaches in reverse engineering aim to incorporate domain knowledge and system documentation in the software architecture extraction process, hence provide a user/tool collaborative environment for ... -
Uniqueness and Complexity in Generalised Colouring
Farrugia, Alastair (University of Waterloo, 2003)The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory that can be looked at, in large part, as the recognition ...