AbstractWe present a reduction theorem for the class of all finite 3-connected graphs which does not make use of the traditional contraction of certain connected subgraphs
Let $G$ be a $3$-connected graph. A set $W \subset V(G)$ is contractible if $G(W)$ is connected and ...
AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by ...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction results in a ...
AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−...
AbstractBy Tutte's constructive characterization of 3-connected graphs (Indag. Math. 23 (1961), 441–...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
Any pair of non-adjacent vertices forms a non-edge in a graph. Contraction of a non-edge merges two ...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
AbstractAn edgeeof a minimally 3-connected graphGis non-essential if and only if the graph obtained ...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
AbstractBy Tutte's constructive characterization of 3-connected graphs (Indag. Math. 23 (1961), 441–...
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...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
Let $G$ be a $3$-connected graph. A set $W \subset V(G)$ is contractible if $G(W)$ is connected and ...
AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by ...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction results in a ...
AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−...
AbstractBy Tutte's constructive characterization of 3-connected graphs (Indag. Math. 23 (1961), 441–...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
Any pair of non-adjacent vertices forms a non-edge in a graph. Contraction of a non-edge merges two ...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
AbstractAn edgeeof a minimally 3-connected graphGis non-essential if and only if the graph obtained ...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
AbstractBy Tutte's constructive characterization of 3-connected graphs (Indag. Math. 23 (1961), 441–...
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...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
Let $G$ be a $3$-connected graph. A set $W \subset V(G)$ is contractible if $G(W)$ is connected and ...
AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by ...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction results in a ...
DOI
Add to ORKG