79 research outputs found
On the Geometric Thickness of 2-Degenerate Graphs
A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every 2-degenerate graph can be drawn with straight lines such that the drawing decomposes into 4 plane forests. Therefore, the geometric arboricity, and hence the geometric thickness, of 2-degenerate graphs is at most 4. On the other hand, we show that there are 2-degenerate graphs that do not admit any straight-line drawing with a decomposition of the edge set into 2 plane graphs. That is, there are 2-degenerate graphs with geometric thickness, and hence geometric arboricity, at least 3. This answers two questions posed by Eppstein [Separating thickness from geometric thickness. In Towards a Theory of Geometric Graphs, vol. 342 of Contemp. Math., AMS, 2004]
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph in the plane such that crossing edges are
coloured differently. The minimum number of colours, taken over all drawings of
, is the classical graph parameter "thickness". By restricting the edges to
be straight, we obtain the "geometric thickness". By further restricting the
vertices to be in convex position, we obtain the "book thickness". This paper
studies the relationship between these parameters and treewidth.
Our first main result states that for graphs of treewidth , the maximum
thickness and the maximum geometric thickness both equal .
This says that the lower bound for thickness can be matched by an upper bound,
even in the more restrictive geometric setting. Our second main result states
that for graphs of treewidth , the maximum book thickness equals if and equals if . This refutes a conjecture of Ganley and
Heath [Discrete Appl. Math. 109(3):215-221, 2001]. Analogous results are proved
for outerthickness, arboricity, and star-arboricity.Comment: A preliminary version of this paper appeared in the "Proceedings of
the 13th International Symposium on Graph Drawing" (GD '05), Lecture Notes in
Computer Science 3843:129-140, Springer, 2006. The full version was published
in Discrete & Computational Geometry 37(4):641-670, 2007. That version
contained a false conjecture, which is corrected on page 26 of this versio
Relating Graph Thickness to Planar Layers and Bend Complexity
The thickness of a graph with vertices is the minimum number of
planar subgraphs of whose union is . A polyline drawing of in
is a drawing of , where each vertex is mapped to a
point and each edge is mapped to a polygonal chain. Bend and layer complexities
are two important aesthetics of such a drawing. The bend complexity of
is the maximum number of bends per edge in , and the layer complexity
of is the minimum integer such that the set of polygonal chains in
can be partitioned into disjoint sets, where each set corresponds
to a planar polyline drawing. Let be a graph of thickness . By
F\'{a}ry's theorem, if , then can be drawn on a single layer with bend
complexity . A few extensions to higher thickness are known, e.g., if
(resp., ), then can be drawn on layers with bend complexity 2
(resp., ). However, allowing a higher number of layers may reduce the
bend complexity, e.g., complete graphs require layers to be drawn
using 0 bends per edge.
In this paper we present an elegant extension of F\'{a}ry's theorem to draw
graphs of thickness . We first prove that thickness- graphs can be
drawn on layers with bends per edge. We then develop another
technique to draw thickness- graphs on layers with bend complexity,
i.e., , where . Previously, the bend complexity was not known to be sublinear for
. Finally, we show that graphs with linear arboricity can be drawn on
layers with bend complexity .Comment: A preliminary version appeared at the 43rd International Colloquium
on Automata, Languages and Programming (ICALP 2016
The 4-girth-thickness of the complete multipartite graph
The -girth-thickness of a graph is the smallest number
of planar subgraphs of girth at least whose union is . In this paper, we
calculate the -girth-thickness of the complete -partite
graph when each part has an even number of vertices.Comment: 6 pages, 1 figur
Edge Partitions of Optimal -plane and -plane Graphs
A topological graph is a graph drawn in the plane. A topological graph is
-plane, , if each edge is crossed at most times. We study the
problem of partitioning the edges of a -plane graph such that each partite
set forms a graph with a simpler structure. While this problem has been studied
for , we focus on optimal -plane and -plane graphs, which are
-plane and -plane graphs with maximum density. We prove the following
results. (i) It is not possible to partition the edges of a simple optimal
-plane graph into a -plane graph and a forest, while (ii) an edge
partition formed by a -plane graph and two plane forests always exists and
can be computed in linear time. (iii) We describe efficient algorithms to
partition the edges of a simple optimal -plane graph into a -plane graph
and a plane graph with maximum vertex degree , or with maximum vertex
degree if the optimal -plane graph is such that its crossing-free edges
form a graph with no separating triangles. (iv) We exhibit an infinite family
of simple optimal -plane graphs such that in any edge partition composed of
a -plane graph and a plane graph, the plane graph has maximum vertex degree
at least and the -plane graph has maximum vertex degree at least .
(v) We show that every optimal -plane graph whose crossing-free edges form a
biconnected graph can be decomposed, in linear time, into a -plane graph and
two plane forests
- …