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...

Weakly and Strongly Fan-Planar Graphs

We study two notions of fan-planarity introduced by (Cheong et al., GD22...

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...

A new upper bound for angular resolution

The angular resolution of a planar straight-line drawing of a graph is t...

Subchromatic numbers of powers of graphs with excluded minors

A k-subcolouring of a graph G is a function f:V(G) →{0,…,k-1} such that ...

Please sign up or login with your details

Forgot password? Click here to reset