Bing Zhou

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2017 J jnl
On Color Critical Graphs with Large Adaptable Chromatic Numbers.
Graphs Comb.
Bing Zhou
2013 J jnl
A lower bound for the chromatic capacity in terms of the chromatic number of a graph.
Discret. Math.
Bing Zhou
2010 J jnl
On a construction of graphs with high chromatic capacity and large girth.
Discret. Math.
Bing Zhou
2010 J jnl
On the Maximal Interval Subgraph of a Tree.
J. Comput. Biol.
Haiying Zhang, Bing Zhou
2001 J jnl
Bounded vertex coloring of trees.
Discret. Math.
Mark Jarvis, Bing Zhou
1998 J jnl
Color-critical graphs and hypergraphs with few edges and no short cycles.
Discret. Math.
H. L. Abbott, Donovan R. Hare, Bing Zhou
1997 J jnl
Some Theorems Concerning the Star Chromatic Number of a Graph.
J. Comb. Theory B
Bing Zhou
1995 J jnl
Large Faces in 4-Critical Planar Graphs with Minimum Degree 4.
Comb.
H. L. Abbott, Donovan R. Hare, Bing Zhou
1995 J jnl
Some Remarks on (
Comb.
H. L. Abbott, Bing Zhou
1994 J jnl
Proof of a conjecture of Dirac concerning 4-critical planar graphs.
Discret. Math.
H. L. Abbott, Meir Katchalski, Bing Zhou
1994 J jnl
Sparse color-critical graphs and hypergraphs with no short cycles.
J. Graph Theory
H. L. Abbott, Bing Zhou, Donovan R. Hare
1993 J jnl
The star chromatic number of a graph.
J. Graph Theory
H. L. Abbott, Bing Zhou
1992 J jnl
On a conjecture of Gallai concerning complete subgraphs of k-critical graphs.
Discret. Math.
H. L. Abbott, Bing Zhou
1991 J jnl
The edge density of 4-critical planar graphs.
Comb.
H. L. Abbott, Bing Zhou