The clique corona operation and greedoids

Vadim E. Levit, Eugen Mandrescu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


S is a local maximum stable set of G, and we write S∈ ∈Ψ(G), if S is a stable set of maximum size in the subgraph induced by S ∪ N(S), where N(S) is the neighborhood of S. It is known that Ψ(G) is a greedoid for every forest G, [10]. Bipartite graphs and triangle-free graphs, whose families of local maximum stable sets form greedoids were characterized in [11] and [12], respectively. The clique corona is the graph G∈=∈H∈? o {H 1,H 2,...,H n } obtained by joining each vertex v k of the graph H with the vertices of some clique H k , respectively. In this paper we demonstrate that if G is a clique corona, then Ψ(G) forms a greedoid on its vertex set.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - Second International Conference, COCOA 2008, Proceedings
Number of pages9
StatePublished - 2008
Event2nd International Conference on Combinatorial Optimization and Applications, COCOA 2008 - St. John's, NL, Canada
Duration: 21 Aug 200824 Aug 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5165 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Conference on Combinatorial Optimization and Applications, COCOA 2008
CitySt. John's, NL


Dive into the research topics of 'The clique corona operation and greedoids'. Together they form a unique fingerprint.

Cite this