Jianji Su

According to our database, Jianji Su authored at least 14 papers between 1993 and 2011.

Collaborative distances:

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

2011

The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs.

Xudong Yuan, Tingting Li, Jianji Su

Ars Comb., 2011

2010

The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs.

Tingting Li, Jianji Su

Graphs Comb., 2010

2009

Removable edges in a k-connected graph and a construction method for k-connected graphs.

Jianji Su, Xiaofeng Guo, Liqiong Xu

Discret. Math., 2009

A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs.

Tingting Li, Jianji Su

Discret. Math., 2009

2008

Some properties of contraction-critical 5-connected graphs.

Chengfu Qin, Xudong Yuan, Jianji Su

Discret. Math., 2008

The number of vertices of degree 7 in a contraction-critical 7-connected graph.

Min Li, Xudong Yuan, Jianji Su

Discret. Math., 2008

2006

A new degree sum condition for the existence of a contractible edge in a <i>kappa</i>-connected graph.

Jianji Su, Xudong Yuan

J. Comb. Theory, Ser. B, 2006

2005

Contractible Edges in 7-Connected Graphs.

Jianji Su, Xudong Yuan

Graphs Comb., 2005

Triangles in contraction critical 5-connected graphs.

Chengfu Qin, Xudong Yuan, Jianji Su

Australas. J Comb., 2005

2004

Proof of Mader's conjecture on <i>k</i>-critical <i>n</i>-connected graphs.

Jianji Su

J. Graph Theory, 2004

The number of removable edges in a 4-connected graph.

Jichang Wu, Xueliang Li, Jianji Su

J. Comb. Theory, Ser. B, 2004

1999

The Number of Removable Edges in 3-Connected Graphs.

Jianji Su

J. Comb. Theory, Ser. B, 1999

1995

Fragments in <i>k</i>critical <i>n</i>-connected graphs.

Jianji Su

J. Graph Theory, 1995

1993

On locally k-critically n-connected graphs.

Jianji Su

Discret. Math., 1993