AbstractIt is proven that every critically n-edge-connected finite graph G contains a vertex of degree n and a vertex x such that G − x is (n − 1)-edge-connected. Furthermore, the minimum number of such vertices in a critically n-edge-connected graph of given order is determined
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-...
AbstractIt is shown in this work that if graph G has degree sequence d1≥d2≥⋯≥dn≥2 with ∑i=1l(di+dn−i...
AbstractIt is proven that every critically n-edge-connected finite graph G contains a vertex of degr...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
AbstractThe vertex connectivity of a graph G is denoted by κ(G) and the minimum degree of G is denot...
AbstractThe old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
It is proved that every finite, non-complete, critically n-connected graph contains two disjoint fra...
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-...
AbstractIt is shown in this work that if graph G has degree sequence d1≥d2≥⋯≥dn≥2 with ∑i=1l(di+dn−i...
AbstractIt is proven that every critically n-edge-connected finite graph G contains a vertex of degr...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
AbstractThe vertex connectivity of a graph G is denoted by κ(G) and the minimum degree of G is denot...
AbstractThe old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
It is proved that every finite, non-complete, critically n-connected graph contains two disjoint fra...
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-...
AbstractIt is shown in this work that if graph G has degree sequence d1≥d2≥⋯≥dn≥2 with ∑i=1l(di+dn−i...
DOI
Add to ORKG