Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs
An edge of a k-connected graph is said to be k-contractible if its contraction results in a k-connected graph. A k-connected non-complete graph with no k-contractible edge, is called contraction critical k-connec...
-
Article
On k- critical 2k- connected graphs
A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ⊆ V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K2k+2?(1-factor) is the uniqu...