Add to ORKGA finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n- vertical stroke X vertical stroke +1)-connected. We present some new results on the number of vertices of an (n, k)-graph, depending on new estimations of the transversal number of an uniform hypergraph with a large independent edge set. (orig.)Available from TIB Hannover: RN 3109(302) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction yields a k-co...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
AbstractIt is proven that every critically n-edge-connected finite graph G contains a vertex of degr...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction results in a ...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
AbstractA graph is called γ-critical if the removal of any vertex from the graph decreases the domin...
AbstractThe vertex connectivity of a graph G is denoted by κ(G) and the minimum degree of G is denot...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
A vertex subset D of G is a dominating set of G if every vertex in V(G)-D is adjacent to a vertex in...
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction yields a k-co...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
AbstractIt is proven that every critically n-edge-connected finite graph G contains a vertex of degr...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction results in a ...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
AbstractA graph is called γ-critical if the removal of any vertex from the graph decreases the domin...
AbstractThe vertex connectivity of a graph G is denoted by κ(G) and the minimum degree of G is denot...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
A vertex subset D of G is a dominating set of G if every vertex in V(G)-D is adjacent to a vertex in...
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
AbstractAn edge of a k-connected graph is said to be k-contractible if its contraction yields a k-co...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...