1 citations · 2 across the 5 of their papers we have counts for
5 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…
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(…
Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
Patrick Hompe, Zishen Qu, Sophie Spirkl
For a digraph and , let be the number of out-neighbors of in . The Caccetta-Häggkvist conjecture states that for all , if is a digraph…
Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
Aristotelis Chaniotis, Zishen Qu, Sophie Spirkl
Given a graph and a graph property we say that is minimal with respect to if no proper induced subgraph of has the property . An HC-obstruction is a minimal…
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs
Joseph Cheriyan, Sepehr Hajebi, Zishen Qu +1
In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw () or a net (a fixed six-vertex graph) as an induc…