Michael C. Wigal

activity

20172025

most citedLarge cycles in essentially 4-connected graphs

1 citations · 1 across the 15 of their papers we have counts for

collaborators

Showing 2021 · math.COShow all

2 papers · 2 filters

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…

math.CO2021

On Tutte cycles containing three prescribed edges

Michael C. Wigal, Xingxing Yu

A cycle $C$ in a graph $G$ is called a Tutte cycle if, after deleting $C$ from $G$ , each component has at most three neighbors on $C$ . Tutte cycles play an important role in the st…