Log In Sign Up

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees

by   Steven Chaplick, et al.

The planar slope number psn(G) of a planar graph G is the minimum number of edge slopes in a planar straight-line drawing of G. It is known that psn(G) ∈ O(c^Δ) for every planar graph G of degree Δ. This upper bound has been improved to O(Δ^5) if G has treewidth three, and to O(Δ) if G has treewidth two. In this paper we prove psn(G) ∈Θ(Δ) when G is a Halin graph, and thus has treewidth three. Furthermore, we present the first polynomial upper bound on the planar slope number for a family of graphs having treewidth four. Namely we show that O(Δ^2) slopes suffice for nested pseudotrees.


page 1

page 2

page 3

page 4


An improved planar graph product structure theorem

Dujmović, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved th...

An Upper Bound for the Number of Rectangulations of a Planar Point Set

We prove that every set of n points in the plane has at most 17^n rectan...

Computing the exact number of periodic orbits for planar flows

In this paper, we consider the problem of determining the exact number o...

Harmless Sets in Sparse Classes

In the classic TARGET SAT SELECTION problem, we are asked to minimise th...

Power series expansions for the planar monomer-dimer problem

We compute the free energy of the planar monomer-dimer model. Unlike the...

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs

Given a planar graph G and an integer b, OrthogonalPlanarity is the prob...

The treewidth and pathwidth of graph unions

For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …, n}, and ...