AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−V(H) is 2-connected. This work is concerned with a conjecture of McCuaig and Ota which states that for any given k there exists an f(k) such that any 3-connected graph on at least f(k) vertices possesses a contractible subgraph on k vertices. We prove this for k⩽4 and consider restrictions to maximal planar graphs, Halin graphs, line graphs of 6-edge-connected graphs, 5-connected graphs of bounded degree, and AT-free graphs
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
Let m ≥ 5 be a positive integer and let G be a 3-connected graph on at least 2m + 1 vertices. We pro...
AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
Let $G$ be a $3$-connected graph. A set $W \subset V(G)$ is contractible if $G(W)$ is connected and ...
AbstractWe present a reduction theorem for the class of all finite 3-connected graphs which does not...
AbstractMcCuaig and Ota proved that every 3-connected graph G on at least 9 vertices admits a contra...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
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...
AbstractBy Tutte's constructive characterization of 3-connected graphs (Indag. Math. 23 (1961), 441–...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
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...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
Let m ≥ 5 be a positive integer and let G be a 3-connected graph on at least 2m + 1 vertices. We pro...
AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
Let $G$ be a $3$-connected graph. A set $W \subset V(G)$ is contractible if $G(W)$ is connected and ...
AbstractWe present a reduction theorem for the class of all finite 3-connected graphs which does not...
AbstractMcCuaig and Ota proved that every 3-connected graph G on at least 9 vertices admits a contra...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
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...
AbstractBy Tutte's constructive characterization of 3-connected graphs (Indag. Math. 23 (1961), 441–...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
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...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-contractible (or simply contracti...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
Let m ≥ 5 be a positive integer and let G be a 3-connected graph on at least 2m + 1 vertices. We pro...