Guofei Zhou

activity

20062015

most citedOn k-hypertournament losing scores

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

collaborators

5 papers

math.CO2015

Constructing a Family of 4-Critical Planar Graphs with High Edge-Density

Yao Tianxing, Zhou Guofei

A graph $G = (V, E)$ is a $k$ -critical graph if $G$ is not $(k - 1)$ -colorable but $G - e$ is $(k - 1)$ -colorable for every $e \in E (G)$ . In this paper, we construct a family of 4-critical…

math.CO2015

Some New Methods for Constructing 4-critical Planar Graphs

Guofei Zhou

A graph $G$ is said to be $k$ -critical if $G$ is $k$ -colorable and $G - e$ is not $k$ -colorable for every edge $e$ of $G$ . In this paper, we present some new methods from two or more…

cs.DM2010

Score lists in multipartite hypertournaments

Shariefuddin Pirzada, Guofei Zhou, Antal Iványi

Given non-negative integers $n_{i}$ and $α_{i}$ with $0 \leq α_{i} \leq n_{i}$ $(i = 1, 2, ..., k)$ , an $[α_{1}, α_{2}, ..., α_{k}]$ - $k$ -partite hypertournament on $\sum_{1}^{k} n_{i}$ vertic…

cs.DM2010★ 8 cited

On k-hypertournament losing scores

Shariefuddin Pirzada, Guofei Zhou

We give a new and short proof of a theorem on k-hypertournament losing scores due to Zhou et al. [G. Zhou, T. Yao, K. Zhang, On score sequences of k-tournaments, European J. Comb.,…

math.CO2006

New proof of a Theorem on k-hypertournament losing scores

S. Pirzada, Zhou Guofei

In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].