AbstractLet G be a 4-connected graph, and let Ec(G) denote the set of 4-contractible edges of G and let Ẽ(G) denote the set of those edges of G which are not contained in a triangle. Under this notation, we show that if |Ẽ(G)|≥15, then we have |Ec(G)|≥(|Ẽ(G)|+8)/4
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...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
Let G be a 4-connected graph, and let E ̃ (G) denote the set of those edges of G which are not conta...
AbstractWe prove that every finite 4-connected graph G has at least 134⋅(|E(G)|−2|V(G)|) many contra...
AbstractWe prove results concerning the distribution of 4-contractible edges in a 4-connected graph ...
AbstractWe prove that every finite 4-connected graph G has at least 134⋅(|E(G)|−2|V(G)|) many contra...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
AbstractLet G be a 4-connected graph, and let Ec(G) denote the set of 4-contractible edges of G and ...
AbstractLet G be a graph and let x be a vertex of degree four with NG(x)={a,b,c,d}. Then the operati...
Research on structural characterizations of graphs is a very popular topic in graph theory. The conc...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
Let G be a 4-connected graph. For an edge e of G; we do the following operations on G: first, delete...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
AbstractLet G be a 4-connected graph. For an edge e of G, we do the following operations on G: first...
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...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
Let G be a 4-connected graph, and let E ̃ (G) denote the set of those edges of G which are not conta...
AbstractWe prove that every finite 4-connected graph G has at least 134⋅(|E(G)|−2|V(G)|) many contra...
AbstractWe prove results concerning the distribution of 4-contractible edges in a 4-connected graph ...
AbstractWe prove that every finite 4-connected graph G has at least 134⋅(|E(G)|−2|V(G)|) many contra...
AbstractIt is proved that if G is a k-connected graph which does not contain K−4, then G has an edge...
AbstractLet G be a 4-connected graph, and let Ec(G) denote the set of 4-contractible edges of G and ...
AbstractLet G be a graph and let x be a vertex of degree four with NG(x)={a,b,c,d}. Then the operati...
Research on structural characterizations of graphs is a very popular topic in graph theory. The conc...
AbstractAn edge xy of a k-connected graph G is said to be k-contractible if the graph G · xy obtaine...
Let G be a 4-connected graph. For an edge e of G; we do the following operations on G: first, delete...
AbstractAn edge of a k-connected graph is said to be k-contractible if the contraction of the edge r...
AbstractLet G be a 4-connected graph. For an edge e of G, we do the following operations on G: first...
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...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
DOI
Add to ORKG