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

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

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

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

Some properties of contraction-critical 5-connected graphs.

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

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

Contractible Edges in 7-Connected Graphs.

Triangles in contraction critical 5-connected graphs.

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

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

The Number of Removable Edges in 3-Connected Graphs.

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

On locally k-critically n-connected graphs.