Michael C. Wigal

collaborators

3 papers

math.CO2023

Sampling planar tanglegrams and pairs of disjoint triangulations

Alexander E. Black, Kevin Liu, Alex Mcdonough +4

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that th…

cs.DS2021

Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes

Gopika Sharma, Arti Pandey, Michael C. Wigal

For a given graph $G$ , a maximum internal spanning tree of $G$ is a spanning tree of $G$ with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem…

math.CO2021

Approximating TSP walks in subcubic graphs

Michael C. Wigal, Youngho Yoo, Xingxing Yu

We prove that every simple 2-connected subcubic graph on $n$ vertices with $n_{2}$ vertices of degree 2 has a TSP walk of length at most $\frac{5 n + n _{2}}{4} - 1$ , confirming a conjecture…