3 citations · 3 across the 4 of their papers we have counts for
5 papers
A combinatorial property of flows on a cycle
Zhuo Diao
In this paper, we prove a combinatorial property of flows on a cycle. is an undirected cycle with two commodities: ;$r_1>0,r_2>0, \mathbf…
On the feedback number of 3-uniform hypergraph
Zhuo Diao, Zhongzheng Tang
Let be a hypergraph with vertex set and edge set . is a feedback vertex set (FVS) of if has no cycle and denote the mini…
Approximation algorithms on cycle covering and clique covering
Zhongzheng Tang, Zhuo Diao
Given a weighted graph with weight . A cycle covering is an edge subset of such that has no cycle. The minimum w…
On the vertex cover number of 3 uniform hypergraph
Zhuo Diao
Given a hypergraph H(V;E), a set of vertices S in V is a vertex cover if every edge has at least a vertex in S. The vertex cover number is the minimum cardinality of a vertex cover…
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
Xujin Chen, Zhuo Diao, Xiaodong Hu +1
Given a simple graph , a subset of is called a triangle cover if it intersects each triangle of . Let and denote the maximum number of pairwise ed…