The edge density of 4-critical planar graphs. - H. L. Abbott; Bing Zhou 004 (Comb., 1991)

On a conjecture of Gallai concerning complete subgraphs of k-critical graphs. - H. L. Abbott; Bing Zhou 004 (Discret. Math., 1992)

The star chromatic number of a graph. - H. L. Abbott; Bing Zhou 004 (J. Graph Theory, 1993)

Proof of a conjecture of Dirac concerning 4-critical planar graphs. - H. L. Abbott; Meir Katchalski; Bing Zhou 004 (Discret. Math., 1994)

Sparse color-critical graphs and hypergraphs with no short cycles. - H. L. Abbott; Bing Zhou 004; Donovan R. Hare (J. Graph Theory, 1994)

Large Faces in 4-Critical Planar Graphs with Minimum Degree 4. - H. L. Abbott; Donovan R. Hare; Bing Zhou 004 (Comb., 1995)

Some Remarks on (k-1)-Critical Subgraphs of k-Critical Graphs. - H. L. Abbott; Bing Zhou 004 (Comb., 1995)

Some Theorems Concerning the Star Chromatic Number of a Graph. - Bing Zhou 004 (J. Comb. Theory B, 1997)

Color-critical graphs and hypergraphs with few edges and no short cycles. - H. L. Abbott; Donovan R. Hare; Bing Zhou 004 (Discret. Math., 1998)

Bounded vertex coloring of trees. - Mark Jarvis; Bing Zhou 004 (Discret. Math., 2001)

On a construction of graphs with high chromatic capacity and large girth. - Bing Zhou 004 (Discret. Math., 2010)

On the Maximal Interval Subgraph of a Tree. - Haiying Zhang; Bing Zhou 004 (J. Comput. Biol., 2010)

A lower bound for the chromatic capacity in terms of the chromatic number of a graph. - Bing Zhou 004 (Discret. Math., 2013)

On Color Critical Graphs with Large Adaptable Chromatic Numbers. - Bing Zhou 004 (Graphs Comb., 2017)