Jianbing Niu

According to our database, Jianbing Niu authored at least 6 papers between 2004 and 2009.

Collaborative distances:

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

2009

Cliques, minors and apex graphs.

Jianbing Niu, Cun-Quan Zhang

Discret. Math., 2009

A note on Berge-Fulkerson coloring.

Rongxia Hao, Jianbing Niu, Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang

Discret. Math., 2009

2007

Chords of longest circuits in locally planar graphs.

Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang

Eur. J. Comb., 2007

2006

A note on class one graphs with maximum degree six.

Xuechao Li, Rong Luo, Jianbing Niu

Discret. Math., 2006

2005

On the structure of <i>k</i>-connected graphs without <i>K_k</i>-minor.

Ken-ichi Kawarabayashi, Rong Luo, Jianbing Niu, Cun-Quan Zhang

Eur. J. Comb., 2005

2004

On potentially (K₄-e)-graphic sequences.

Elaine M. Eschen, Jianbing Niu

Australas. J Comb., 2004