AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. Let Kn− stand for the graph obtained from Kn by removing one edge. Let G be a k-connected graph (k⩾5). It is known that if either “k is odd and G contains no K4−=K2+2K1” or “G contains no K1+2K2”, then G has a k-contractible edge. In this paper, we prove that if G contains neither K2+sK1 nor K1+tK2 with positive integers s,t such that s(t−1)<k, then G has a k-contractible edge. We also prove that if δ(G)⩾k+1 and G contains neither K5− nor 5K1+P3, then G has a k-contractible edge
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-removable if $G-e$ is still $k$-c...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
An edge in a k-conected graph is said to be k-contractible if the contraction of it results in a k-c...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one ...
Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one ...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction results in a ...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-removable if $G-e$ is still $k$-c...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
An edge in a k-conected graph is said to be k-contractible if the contraction of it results in a k-c...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one ...
Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one ...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction results in a ...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-removable if $G-e$ is still $k$-c...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...