2009/05/07 by Vadim E. Levit, Levit, Vadim E., Eugen Mandrescu +1
Computer Science · Mathematics · #05B35 (Primary) #05C69 #51D10 #90C27 (Secondary) #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:05B35 #msc:05C69 #msc:51D10 #msc:90C27
paper · pdf · doi:10.48550/arxiv.0905.1024
9 pages; 4 figures
arxiv created 2009/05/07 · arxiv updated 2011/01/25
A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, if S is a maximum stable set of the subgraph induced by its closed neighborhood. It is known that the family of all local maximum stable sets of a forest forms a greedoid on its vertex set. Bipartite, triangle-free, and well-covered graphs whose families of local maximum stable sets form greedoids have been analyzed as well. A unicycle graph owns only one cycle. In this paper we characterize the unicycle graphs whose families of local maximum stable sets form greedoids.