DeepAI AI Chat
Log In Sign Up

Caterpillars and alternating paths

by   Rain Jiang, et al.

Let p(m) (respectively, q(m)) be the maximum number k such that any tree with m edges can be transformed by contracting edges (respectively, by removing vertices) into a caterpillar with k edges. We derive closed-form expressions for p(m) and q(m) for all m ≥ 1. The two functions p(n) and q(n) can also be interpreted in terms of alternating paths among n disjoint line segments in the plane, whose 2n endpoints are in convex position.


Disjoint edges in geometric graphs

A geometric graph is a graph drawn in the plane so that its vertices and...

(Theta, triangle)-free and (even hole, K_4)-free graphs. Part 2 : bounds on treewidth

A theta is a graph made of three internally vertex-disjoint chordless p...

Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane

Let E={e_1,…,e_n} be a set of C-oriented disjoint segments in the plane,...

The exact chromatic number of the convex segment disjointness graph

Let P be a set of n points in strictly convex position in the plane. Let...

Alternating Path and Coloured Clustering

In the Coloured Clustering problem, we wish to colour vertices of an edg...

A DFS Algorithm for Maximum Matchings in General Graphs

In this paper, we propose a depth-first search (DFS) algorithm for searc...

Combining contextual and local edges for line segment extraction in cluttered images

Automatic extraction methods typically assume that line segments are pro...