14 citations · 27 across the 19 of their papers we have counts for
5 papers · 2 filters
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…
Alon-Tarsi number of signed planar graphs
Wei Wang, Jianguo Qian
Let be any signed planar graph. We show that the Alon-Tarsi number of is at most 5, generalizing a recent result of Zhu for unsigned case. In addition, if i…
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 , if then . This indicates that the graphs with high chroma…
Colorings v.s. list colorings of uniform hypergraphs
Wei Wang, Jianguo Qian, Zhidan Yan
Let be an integer with and be a connected -uniform hypergraph with edges. By refining the broken cycle theorem for hypergraphs, we show that if $k>\frac{m-1…
New families of graphs determined by their generalized spectrum
Fenjin Liu, Johannes Siemons, Wei Wang
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a g…