Yixuan Huang

collaborators

2 papers

math.CO2025

Bipartite holes, degree sums and Hamilton cycles

Mark Ellingham, Yixuan Huang, Bing Wei

The {\em bipartite-hole-number} of a graph $G$ , denoted as $I^\pm (G)$ , is the minimum number $k$ such that there exist integers $a$ and $b$ with $a + b = k + 1$ such that for…

math.CO2024

Spanning weakly even trees of graphs

Jiangdong Ai, M. N. Ellingham, Zhipeng Gao +5

Let $G$ be a graph (with multiple edges allowed) and let $T$ be a tree in $G$ . We say that $T$ is $even$ if every leaf of $T$ belongs to the same part of the bipartition o…