May 7, 2009 · In this paper we characterize the unicycle graphs whose families of local maximum stable sets form greedoids. Comments: 9 pages; 4 figures.

and as we mentioned before, its family Ψ(G) is not a greedoid. However,. there exist bipartite graphs whose families Ψ(G) are greedoids.

Abstract. A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ Ψ(G),.

Greedoids on Vertex Sets of Unicycle Graphs. Vadim E. Levit, Eugen Mandrescu. Department of Mathematics. Research output: Working paper › Preprint.

The following findings describe some classes of graphs generating greedoids. Theorem 1.4. (i) [15] For every forest T, 'I >(T) is a greedoid.

Greedoids On Vertex Sets Of Unicycle Graphs. Book Code: 1111021523518. Vadim E. Levit,Eugen Mandrescu. All Prices are including Free shipping via Air-Mail.

In this paper we present several necessary and sufficient conditions for Ψ(B (G1, G2)) to form a greedoid, an antimatroid, and a matroid, in terms of Ψ(G1), Ψ( ...

forms a greedoid on its vertex sets. We pose the question of characterizing the unicycle non-bipartite graphs whose families of local maximum stable sets are.

For a bipartite graph G , Ψ ( G ) is a greedoid on its vertex set if and only if all its maximum matchings are uniquely restricted. The case of bipartite graphs ...

Oct 22, 2024 · It was shown that psi(G) is a greedoid for every forest G [15]. The cases of bipartite graphs, triangle-free graphs, and well-covered graphs, ...