3 papers
math.CO2024
Spanning weakly even trees of graphs
Jiangdong Ai, M. N. Ellingham, Zhipeng Gao +5
Let be a graph (with multiple edges allowed) and let be a tree in . We say that is if every leaf of belongs to the same part of the bipartition o…
math.CO2024
A short note on spanning even trees
Jiangdong Ai, Zhipeng Gao, Xiangzhou Liu +1
We call a tree is \emph{even} if every pair of its leaves is joined by a path of even length. Jackson and Yoshimoto~[J. Graph Theory, 2024] conjectured that every -regular n…
math.CO2024
On independent domination and packing numbers of subcubic graphs
Xuqing Bai, Zhipeng Gao, Changqing Xi +1
In a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of…