Yunfang Tang

collaborators

2 papers

math.CO2024

Generalized Petersen graphs are (1,3)-choosable

Yunfang Tang, Yuting Yao

A total weighting of a graph $G$ is a mapping $ϕ$ that assigns a weight to each vertex and each edge of $G$ . The vertex-sum of $v \in V (G)$ with respect to $ϕ$ is $S_ϕ(v)=\sum_{e\i…

math.CO2019

Linear algorithms on Steiner domination of trees

Yueming Shen, Chengye Zhao, Chenglin Gao +1

A set of vertices $W$ in a connected graph $G$ is called a Steiner dominating set if $W$ is both Steiner and dominating set. The Steiner domination number $γ_{s t} (G)$ is the minimu…