Tarim University

output

20112024

most citedLi-rich and super Li-rich giants produced by element diffusion

12 citations

Showing math.COShow all

6 papers · 1 filter

math.CO2018

A generalization of Noel-Reed-Wu Theorem to signed graphs

Wei Wang, Jianguo Qian

Let $Σ$ be a signed graph where two edges joining the same pair of vertices with opposite signs are allowed. The zero-free chromatic number $χ^{*} (Σ)$ of $Σ$ is the minimum even inte…

math.CO2018

Chromatic-choosability of hypergraphs with high chromatic number

Wei Wang, Jianguo Qian

It was conjectured by Ohba and confirmed recently by Noel et al. that, for any graph $G$ , if $∣ V (G) ∣ \leq 2 χ (G) + 1$ then $χ_{l} (G) = χ (G)$ . This indicates that the graphs with high chroma…

math.CO2018

Colorings v.s. list colorings of uniform hypergraphs

Wei Wang, Jianguo Qian, Zhidan Yan

Let $r$ be an integer with $r \geq 2$ and $G$ be a connected $r$ -uniform hypergraph with $m$ edges. By refining the broken cycle theorem for hypergraphs, we show that if $k>\frac{m-1…

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.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…