Zhibo Chen

Affiliations:
  • Penn State University, Department of Mathematics, McKeesport, PA, USA


According to our database1, Zhibo Chen authored at least 19 papers between 1988 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges.
Graphs Comb., 2019

2018
Forcing and anti-forcing edges in bipartite graphs.
Discret. Appl. Math., 2018

2016
Minimum order of r-regular bipartite graphs of pair length k.
Australas. J Comb., 2016

2015
Sharp bounds on the size of pairable graphs and pairable bipartite graphs.
Australas. J Comb., 2015

2013
Forcing faces in plane bipartite graphs (II).
Discret. Appl. Math., 2013

2010
On k-pairable regular graphs.
Discret. Math., 2010

2008
Forcing faces in plane bipartite graphs.
Discret. Math., 2008

2006
On commutativity of two unary digraph operations: Subdividing and line-digraphing.
Discret. Math., 2006

2005
Transpositions and Representability.
Am. Math. Mon., 2005

2004
On <i>k</i>-pairable graphs.
Discret. Math., 2004

2002
On Integral Sum Graphs.
Electron. Notes Discret. Math., 2002

Ordering graphs with small index and its application.
Discret. Appl. Math., 2002

1998
Integral sum graphs from identification.
Discret. Math., 1998

On uniquely 3-colorable graphs II.
Discret. Math., 1998

1996
Harary's conjectures on integral sum graphs.
Discret. Math., 1996

On polynomial functions from Zn<sub>1</sub> × Zn<sub>2</sub> × ... × Zn<sub>r</sub> to Zm.
Discret. Math., 1996

1995
On polynomial functions from Z<sub>n</sub> to Z<sub>m</sub>.
Discret. Math., 1995

1993
On uniquely 3-colorable graphs.
Discret. Math., 1993

1988
Bounds of the longest directed cycle length for minimal strong digraphs.
Discret. Math., 1988


  Loading...