Add to ORKGA graph G is (Kq; k) stable if it contains a copy of Kq after deleting any subset of k vertices. In a previous paper we have characterized the (Kq; k) stable graphs with minimum size for 3 q 5 and we have proved that the only (Kq; k) stable graph with minimum size is Kq+k for q 5 and k 3. We show that for q 6 and k q2 + 1 the only (Kq; k) stable graph with minimum size is isomorphic to Kq+k.
AbstractWe call a graph Gk-stable (with respect to some graph H) if, deleting any k edges of G, the ...
An undirected graph G = (V,E) is stable if its inessential vertices (those that are exposed by at le...
AbstractWe give a O(nm) time algorithm for the maximum weight stable set (MWS) problem on P5- and co...
AbstractA graph G is a (Kq,k) vertex stable graph if it contains a Kq after deleting any subset of k...
A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k verti...
Let us call a G (H,k) graph vertex stable if it contains a subgraph H ever after removing any of its...
A graph G is called (H;k)-vertex stable if G contains a subgraph isomorphic to H ever after removing...
A graph G is a (K_q; k) vertex stable graph (q >= 3) if it contains a clique K_q after deleting any ...
Let us call a graph G(H;k) vertex stable if it contains a subgraph H after removing any of its k ver...
AbstractA graph G is called (H;k)-vertex stable if G contains a subgraph isomorphic to H even after ...
In this project, we explore the results of the article On (Kq; k)-Stable Graphs by Andrzej ak [4]. ...
Let H be any graph. We say that graph G is H-stable if G — u contains a subgraph isomorphic to H for...
Tyt. z nagłówka.Bibliogr. s. 913-914.Let H be any graph. We say that graph G is H-stable if G−u cont...
AbstractA graph G is called (H;k)-vertex stable if G contains a subgraph isomorphic to H even after ...
AbstractThe stability number α(G) of a graph G is the cardinality of a stability system of G (that i...
AbstractWe call a graph Gk-stable (with respect to some graph H) if, deleting any k edges of G, the ...
An undirected graph G = (V,E) is stable if its inessential vertices (those that are exposed by at le...
AbstractWe give a O(nm) time algorithm for the maximum weight stable set (MWS) problem on P5- and co...
AbstractA graph G is a (Kq,k) vertex stable graph if it contains a Kq after deleting any subset of k...
A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k verti...
Let us call a G (H,k) graph vertex stable if it contains a subgraph H ever after removing any of its...
A graph G is called (H;k)-vertex stable if G contains a subgraph isomorphic to H ever after removing...
A graph G is a (K_q; k) vertex stable graph (q >= 3) if it contains a clique K_q after deleting any ...
Let us call a graph G(H;k) vertex stable if it contains a subgraph H after removing any of its k ver...
AbstractA graph G is called (H;k)-vertex stable if G contains a subgraph isomorphic to H even after ...
In this project, we explore the results of the article On (Kq; k)-Stable Graphs by Andrzej ak [4]. ...
Let H be any graph. We say that graph G is H-stable if G — u contains a subgraph isomorphic to H for...
Tyt. z nagłówka.Bibliogr. s. 913-914.Let H be any graph. We say that graph G is H-stable if G−u cont...
AbstractA graph G is called (H;k)-vertex stable if G contains a subgraph isomorphic to H even after ...
AbstractThe stability number α(G) of a graph G is the cardinality of a stability system of G (that i...
AbstractWe call a graph Gk-stable (with respect to some graph H) if, deleting any k edges of G, the ...
An undirected graph G = (V,E) is stable if its inessential vertices (those that are exposed by at le...
AbstractWe give a O(nm) time algorithm for the maximum weight stable set (MWS) problem on P5- and co...