Bing Zhou

According to our database, Bing Zhou authored at least 14 papers between 1991 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

On Color Critical Graphs with Large Adaptable Chromatic Numbers.

Bing Zhou

Graphs Comb., 2017

2013

A lower bound for the chromatic capacity in terms of the chromatic number of a graph.

Bing Zhou

Discret. Math., 2013

2010

On the Maximal Interval Subgraph of a Tree.

Haiying Zhang, Bing Zhou

J. Comput. Biol., 2010

On a construction of graphs with high chromatic capacity and large girth.

Bing Zhou

Discret. Math., 2010

2001

Bounded vertex coloring of trees.

Mark Jarvis, Bing Zhou

Discret. Math., 2001

1998

Color-critical graphs and hypergraphs with few edges and no short cycles.

H. L. Abbott, Donovan R. Hare, Bing Zhou

Discret. Math., 1998

1997

Some Theorems Concerning the Star Chromatic Number of a Graph.

Bing Zhou

J. Comb. Theory B, 1997

1995

Some Remarks on (<i>k</i>-1)-Critical Subgraphs of <i>k</i>-Critical Graphs.

H. L. Abbott, Bing Zhou

Comb., 1995

Large Faces in 4-Critical Planar Graphs with Minimum Degree 4.

H. L. Abbott, Donovan R. Hare, Bing Zhou

Comb., 1995

1994

Sparse color-critical graphs and hypergraphs with no short cycles.

H. L. Abbott, Bing Zhou, Donovan R. Hare

J. Graph Theory, 1994

Proof of a conjecture of Dirac concerning 4-critical planar graphs.

H. L. Abbott, Meir Katchalski, Bing Zhou

Discret. Math., 1994

1993

The star chromatic number of a graph.

H. L. Abbott, Bing Zhou

J. Graph Theory, 1993

1992

On a conjecture of Gallai concerning complete subgraphs of k-critical graphs.

H. L. Abbott, Bing Zhou

Discret. Math., 1992

1991

The edge density of 4-critical planar graphs.

H. L. Abbott, Bing Zhou

Comb., 1991