Bounded embeddings of graphs in the plane

TL;DR

This paper characterizes when graphs can be embedded in the plane with constraints on the x-coordinate based on a vertex function, and provides an efficient algorithm for trees and certain graphs, impacting c-planarity testing.

Contribution

It offers a characterization of x-bounded embeddings and an efficient testing algorithm for trees and generalized Theta-graphs, advancing understanding of constrained graph embeddings.

Findings

Characterization of isotopy classes of x-bounded embeddings.

Efficient algorithm for trees and generalized Theta-graphs.

Partial resolution of c-planarity testing complexity for flat clustered graphs.

Abstract

A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq \gamma(v)$, where $uv\in E$ and $\gamma(u)\leq \gamma(v)$, whenever $x(w)\in x(uv)$, where $x(.)$ denotes the projection to the $x$-axis. We prove a characterization of isotopy classes of graph embeddings in the plane containing an $x$-bounded embedding. Then we present an efficient algorithm, that relies on our result, for testing the existence of an $x$-bounded embedding if the given graph is a tree or generalized $\Theta$-graph. This partially answers a question raised recently by Angelini et al. and Chang et al., and proves that c-planarity testing of flat clustered graphs with three clusters is tractable if each connected component of the underlying abstract graph is a tree.