16 citations · 19 across the 5 of their papers we have counts for
4 papers · 1 filter
Bipartite graphs with uniquely restricted maximum matchings and their corresponding greedoids
Vadim E. Levit, Eugen Mandrescu
A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set if it is a maximum stable set of the subgraph of G spanned by the union of S and…
The Intersection of All Maximum Stable Sets of a Tree and its Pendant Vertices
Vadim E. Levit, Eugen Mandrescu
A stable set in a graph G is a set of mutually non-adjacent vertices, alpha(G) is the size of a maximum stable set of G, and core(G) is the intersection of all its maximum stable s…
On -Stable Graphs
Vadim E. Levit, Eugen Mandrescu
The stability number of a graph G, denoted by alpha(G), is the cardinality of a stable set of maximum size in G. A graph is well-covered if every maximal stable set has the same si…
On -Critical Edges in König-Egerváry Graphs
Vadim E. Levit, Eugen Mandrescu
The stability number of a graph G, denoted by alpha(G), is the cardinality of a stable set of maximum size in G. If alpha(G-e) > alpha(G), then e is an alpha-critical edge, and if…