Zhuo Diao

collaborators

5 papers

math.CO2018

A combinatorial property of flows on a cycle

Zhuo Diao

In this paper, we prove a combinatorial property of flows on a cycle. $C (V, E)$ is an undirected cycle with two commodities: ${s_{1}, t_{1}}, {s_{2}, t_{2}}$ ;$r_1>0,r_2>0, \mathbf…

math.CO2018

On the feedback number of 3-uniform hypergraph

Zhuo Diao, Zhongzheng Tang

Let $H = (V, E)$ be a hypergraph with vertex set $V$ and edge set $E$ . $S \subseteq V$ is a feedback vertex set (FVS) of $H$ if $H ∖ S$ has no cycle and $τ_{c} (H)$ denote the mini…

cs.DM2018

Approximation algorithms on $k -$ cycle covering and $k -$ clique covering

Zhongzheng Tang, Zhuo Diao

Given a weighted graph $G (V, E)$ with weight $w : E \to Z_{+}^{∣ E ∣}$ . A $k -$ cycle covering is an edge subset $A$ of $E$ such that $G - A$ has no $k -$ cycle. The minimum w…

math.CO2018

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…

cs.GR2016

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles

Xujin Chen, Zhuo Diao, Xiaodong Hu +1

Given a simple graph $G = (V, E)$ , a subset of $E$ is called a triangle cover if it intersects each triangle of $G$ . Let $ν_{t} (G)$ and $τ_{t} (G)$ denote the maximum number of pairwise ed…

A combinatorial property of flows on a cycle

On the feedback number of 3-uniform hypergraph

Approximation algorithms on k− cycle covering and k− clique covering

On the vertex cover number of 3 uniform hypergraph

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles

Approximation algorithms on $k -$ cycle covering and $k -$ clique covering