Douglas B. West

collaborators

2 papers

math.CO2025

Caterpillars with $n$ vertices are reconstructible from subgraphs with at most $n /2 + 1$ vertices

Alexandr V. Kostochka, Zishen Qu, Maddy Ritter +1

The $\textit{$m$-deck}$ of an $n$ -vertex graph is the multiset of unlabeled induced subgraphs with $m$ vertices. Caterpillars are trees in which all nonleaf vertices lie on a singl…

math.CO2024

Strong parity edge-colorings of graphs

Peter Bradshaw, Sergey Norin, Douglas B. West

An edge-coloring of a graph $G$ assigns a color to each edge of $G$ . An edge-coloring is a parity edge-coloring if for each path $P$ in $G$ , it uses some color on an odd number of…

Caterpillars with n vertices are reconstructible from subgraphs with at most n/2+1 vertices

Strong parity edge-colorings of graphs

Caterpillars with $n$ vertices are reconstructible from subgraphs with at most $n /2 + 1$ vertices