{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:41Z","timestamp":1725516641239},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_36","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"384-392","source":"Crossref","is-referenced-by-count":2,"title":["The Clique Corona Operation and Greedoids"],"prefix":"10.1007","author":[{"given":"Vadim E.","family":"Levit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugen","family":"Mandrescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1017\/CBO9780511662041.009","volume-title":"Matroid Applications","author":"A. Bj\u00f6rner","year":"1992","unstructured":"Bj\u00f6rner, A., Ziegler, G.M.: Introduction to greedoids. In: White, N. (ed.) Matroid Applications, pp. 284\u2013357. Cambridge University Press, Cambridge (1992)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0167-5060(08)70387-X","volume":"55","author":"V. Chv\u00e1tal","year":"1993","unstructured":"Chv\u00e1tal, V., Slater, P.J.: A note on well-covered graphs. Quo Vadis, Graph Theory? Annals of Discrete Math.\u00a055, 179\u2013182 (1993)","journal-title":"Quo Vadis, Graph Theory? Annals of Discrete Math."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0012-365X(82)90215-1","volume":"42","author":"O. Favaron","year":"1982","unstructured":"Favaron, O.: Very well-covered graphs. Discrete Mathematics\u00a042, 177\u2013187 (1982)","journal-title":"Discrete Mathematics"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1993.1005","volume":"57","author":"A. Finbow","year":"1993","unstructured":"Finbow, A., Hartnell, B., Nowakowski, R.J.: A characterization of well-covered graphs of girth 5 or greater. J. of Combinatorial Theory, Ser. B\u00a057, 44\u201368 (1993)","journal-title":"J. of Combinatorial Theory, Ser. B"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(94)00117-V","volume":"64","author":"B. Hartnell","year":"1996","unstructured":"Hartnell, B., Plummer, M.D.: On 4-connected claw-free well-covered graphs. Discrete Applied Mathematics\u00a064, 57\u201365 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58191-5","volume-title":"Greedoids","author":"B. Korte","year":"1991","unstructured":"Korte, B., Lov\u00e1sz, L., Schrader, R.: Greedoids. Springer, Berlin (1991)"},{"key":"36_CR7","first-page":"209","volume":"130","author":"V.E. Levit","year":"1998","unstructured":"Levit, V.E., Mandrescu, E.: Well-covered and K\u00f6nig-Egerv\u00e1ry graphs. Congressus Numerantium\u00a0130, 209\u2013218 (1998)","journal-title":"Congressus Numerantium"},{"key":"36_CR8","first-page":"101","volume":"139","author":"V.E. Levit","year":"1999","unstructured":"Levit, V.E., Mandrescu, E.: Well-covered trees. Congressus Numerantium\u00a0139, 101\u2013112 (1999)","journal-title":"Congressus Numerantium"},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-1-4471-0717-0_13","volume-title":"Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS 2001)","author":"V.E. Levit","year":"2001","unstructured":"Levit, V.E., Mandrescu, E.: Unicycle bipartite graphs with only uniquely restricted maximum matchings. In: Calude, C.S., Dinneen, M.J., Sburlan, S. (eds.) Proceedings of the Third International Conference on Combinatorics, Computability and Logic (DMTCS 2001), pp. 151\u2013158. Springer, Heidelberg (2001)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0166-218X(01)00332-8","volume":"124","author":"V.E. Levit","year":"2002","unstructured":"Levit, V.E., Mandrescu, E.: A new greedoid: the family of local maximum stable sets of a forest. Discrete Applied Mathematics\u00a0124, 91\u2013101 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0166-218X(03)00398-6","volume":"132","author":"V.E. Levit","year":"2003","unstructured":"Levit, V.E., Mandrescu, E.: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discrete Applied Mathematics\u00a0132, 163\u2013174 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"2414","DOI":"10.1016\/j.dam.2007.05.039","volume":"155","author":"V.E. Levit","year":"2007","unstructured":"Levit, V.E., Mandrescu, E.: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discrete Applied Mathematics\u00a0155, 2414\u20132425 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter Jr., L.E.: Vertex packings: structural properties and algorithms. Mathematical Programming\u00a08, 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","volume":"8","author":"M.D. Plummer","year":"1970","unstructured":"Plummer, M.D.: Some covering concepts in graphs. J. of Combinatorial Theory\u00a08, 91\u201398 (1970)","journal-title":"J. of Combinatorial Theory"},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/16073606.1993.9631737","volume":"16","author":"M.D. Plummer","year":"1993","unstructured":"Plummer, M.D.: Well-covered graphs: a survey. Quaestiones Mathematicae\u00a016, 253\u2013287 (1993)","journal-title":"Quaestiones Mathematicae"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<113::AID-JGT1>3.0.CO;2-U","volume":"21","author":"E. Prisner","year":"1996","unstructured":"Prisner, E., Topp, J., Vestergaard, P.D.: Well-covered simplicial, chordal, and circular arc graphs. J. of Graph Theory\u00a021, 113\u2013119 (1996)","journal-title":"J. of Graph Theory"},{"key":"36_CR17","first-page":"20","volume":"2","author":"G. Ravindra","year":"1977","unstructured":"Ravindra, G.: Well-covered graphs. J. Combin. Inform. System Sci.\u00a02, 20\u201321 (1977)","journal-title":"J. Combin. Inform. System Sci."},{"issue":"3","key":"36_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230220304","volume":"22","author":"R. Sankaranarayana","year":"1992","unstructured":"Sankaranarayana, R., Stewart, L.K.: Complexity results for well-covered graphs. Networks\u00a022(3), 247\u2013262 (1992)","journal-title":"Networks"},{"key":"36_CR19","unstructured":"Staples, J.A.: On some sub-classes of well-covered graphs, Ph. D. Thesis, Vanderbilt University (1975)"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/jctb.1996.0022","volume":"B 66","author":"D. Tankus","year":"1996","unstructured":"Tankus, D., Tarsi, M.: Well-covered claw-free graphs. J. of Combinatorial Theory Ser.\u00a0B 66, 293\u2013302 (1996)","journal-title":"J. of Combinatorial Theory Ser."},{"key":"36_CR21","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1006\/jctb.1996.1742","volume":"69","author":"D. Tankus","year":"1997","unstructured":"Tankus, D., Tarsi, M.: The structure of well-covered graphs and the complexity of their recognition problems. J. of Combinatorial Theory Ser.\u00a0B 69, 230\u2013233 (1997)","journal-title":"J. of Combinatorial Theory, Ser."},{"key":"36_CR22","first-page":"199","volume":"33","author":"J. Topp","year":"1992","unstructured":"Topp, J., Volkmann, L.: On the well coveredness of products of graphs. Ars Combinatoria\u00a033, 199\u2013215 (1992)","journal-title":"Ars Combinatoria"},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney, H.: On the abstract properties of linear independence. Amer. J. Math.\u00a057, 509\u2013533 (1935)","journal-title":"Amer. J. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:06Z","timestamp":1619523666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}