2 citations · 2 across the 4 of their papers we have counts for
6 papers · 1 filter
Caterpillars with vertices are reconstructible from subgraphs with at most vertices
Alexandr V. Kostochka, Zishen Qu, Maddy Ritter +1
The $\textit{$m$-deck}$ of an -vertex graph is the multiset of unlabeled induced subgraphs with vertices. Caterpillars are trees in which all nonleaf vertices lie on a singl…
Strong parity edge-colorings of graphs
Peter Bradshaw, Sergey Norin, Douglas B. West
An edge-coloring of a graph assigns a color to each edge of . An edge-coloring is a parity edge-coloring if for each path in , it uses some color on an odd number of…
Acyclic graphs with at least vertices are -recognizable
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
The -deck of an -vertex graph is the multiset of subgraphs obtained from it by deleting vertices. A family of -vertex graphs is -recognizable if every…
Another Proof of the Generalized Tutte--Berge Formula for -Bounded Subgraphs
Zishen Qu, Douglas B. West
Given a nonnegative integer weight for each vertex in a multigraph , an {\it -bounded subgraph} of is a multigraph contained in such that $d_H(v)\le f(…
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs
Alexandr V. Kostochka, Douglas B. West, Zimu Xiang
We study the minimum number of maximum matchings in a bipartite multigraph G with parts and under various conditions, refining the well-known lower bound due to M. Hall. Wh…
Acyclic graphs with at least vertices are -recognizable
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
The -deck of an -vertex graph is the multiset of subgraphs obtained from it by deleting vertices. A family of -vertex graphs is -recognizable if every…