Caterpillars and alternating paths

09/12/2021
by   Rain Jiang, et al.
0

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.

READ FULL TEXT
research
11/09/2021

Disjoint edges in geometric graphs

A geometric graph is a graph drawn in the plane so that its vertices and...
research
01/06/2020

(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...
research
07/06/2023

Convex Hull Thrackles

A thrackle is a graph drawn in the plane so that every pair of its edges...
research
02/14/2023

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,...
research
04/03/2018

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...
research
01/30/2022

A DFS Algorithm for Maximum Matchings in General Graphs

In this paper, we propose a depth-first search (DFS) algorithm for searc...
research
07/27/2018

Alternating Path and Coloured Clustering

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

Please sign up or login with your details

Forgot password? Click here to reset