Zhidan Yan

most citedEquitable chromatic threshold of complete multipartite graphs

5 citations · 6 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2012

Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs

Zhidan Yan, Wei Wang

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph $G$ , denoted by $χ_{=} (G)$ , is the minim…

math.CO2012★ 5 cited

Equitable chromatic threshold of complete multipartite graphs

Zhidan Yan, Wei Wang

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The equitable chromatic number of a graph $G$ , denoted by $χ_{=} (G)$ , is the min…

math.CO2011★ 1 cited

Connectivity of Kronecker products by K2

Wei Wang, Zhidan Yan

Let $κ (G)$ be the connectivity of $G$ . The Kronecker product $G_{1} \times G_{2}$ of graphs $G_{1}$ and $G_{2}$ has vertex set $V (G_{1} \times G_{2}) = V (G_{1}) \times V (G_{2})$ and edge set $E(G_1\tim…

math.CO2011

On the edge connectivity of direct products with dense graphs

Wei Wang, Zhidan Yan

Let $κ^{'} (G)$ be the edge connectivity of $G$ and $G \times H$ the direct product of $G$ and $H$ . Let $H$ be an arbitrary dense graph with minimal degree $δ (H) > ∣ H ∣/2$ . We prove that f…