(H,k) stable bipartite graphs with minimum size
Aneta Dudek, Małgorzata Zwonek (2009)
Discussiones Mathematicae Graph Theory
Similarity:
Let us call a graph G(H;k) vertex stable if it contains a subgraph H after removing any of its k vertices. In this paper we are interested in finding the (respectively ) vertex stable graphs with minimum size.