{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T19:38:18Z","timestamp":1770838698263,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T00:00:00Z","timestamp":1530576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s11083-018-9461-8","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T10:36:37Z","timestamp":1530614197000},"page":"199-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Monotonic Properties of Collections of Maximum Independent Sets of a Graph"],"prefix":"10.1007","volume":"36","author":[{"given":"Adi","family":"Jarden","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4190-7050","authenticated-orcid":false,"given":"Vadim E.","family":"Levit","sequence":"additional","affiliation":[]},{"given":"Eugen","family":"Mandrescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"9461_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0097-3165(03)00015-3","volume":"102","author":"A Bj\u00f6rner","year":"2003","unstructured":"Bj\u00f6rner, A.: Nerves, fibers and homotopy groups. Journal of Combinatorial Theory A 102, 88\u201393 (2003)","journal-title":"Journal of Combinatorial Theory A"},{"key":"9461_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(01)00327-4","volume":"124","author":"E Boros","year":"2002","unstructured":"Boros, E., Golumbic, M.C., Levit, V.E.: On the number of vertices belonging to all maximum stable sets of a graph. Discret. Appl. Math. 124, 17\u201325 (2002)","journal-title":"Discret. Appl. Math."},{"key":"9461_CR3","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.orl.2006.07.004","volume":"35","author":"S Butenko","year":"2007","unstructured":"Butenko, S., Trukhanov, S.: Using critical sets to solve the maximum independent set problem. Oper. Res. Lett. 35, 519\u2013524 (2007)","journal-title":"Oper. Res. Lett."},{"key":"9461_CR4","unstructured":"DeLaVina, E.: Written on the Wall II, Conjectures of Graffiti.pc. http:\/\/cms.dt.uh.edu\/faculty\/delavinae\/research\/wowII\/"},{"key":"9461_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","volume":"27","author":"RW Deming","year":"1979","unstructured":"Deming, R.W.: Independence numbers of graphs - an extension of the K\u00f6nig-Egerv\u00e1ry theorem. Discret. Math. 27, 23\u201333 (1979)","journal-title":"Discret. Math."},{"key":"9461_CR6","doi-asserted-by":"crossref","unstructured":"Korach, E., Nguyen, T., Peis, B.: Subgraph characterization of red\/blue-split graphs and K\u00f6nig-Egerv\u00e1ry graphs. In: Proceedings of the Seventeenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 842\u2013850. ACM Press (2006)","DOI":"10.1145\/1109557.1109650"},{"key":"9461_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71962-5","volume-title":"Combinatorial Algebraic Topology","author":"D Kozlov","year":"2008","unstructured":"Kozlov, D.: Combinatorial Algebraic Topology. Springer, Berlin (2008)"},{"key":"9461_CR8","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.ejc.2010.10.004","volume":"32","author":"CE Larson","year":"2011","unstructured":"Larson, C.E.: The critical independence number and an independence decomposition. Eur. J. Comb. 32, 294\u2013300 (2011)","journal-title":"Eur. J. Comb."},{"key":"9461_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(01)00183-4","volume":"117","author":"VE Levit","year":"2002","unstructured":"Levit, V.E., Mandrescu, E.: Combinatorial properties of the family of maximum stable sets of a graph. Discret. Appl. Math. 117, 149\u2013161 (2002)","journal-title":"Discret. Appl. Math."},{"key":"9461_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(02)00528-9","volume":"263","author":"VE Levit","year":"2003","unstructured":"Levit, V.E., Mandrescu, E.: On \u03b1 +-stable K\u00f6nig-Egerv\u00e1ry graphs. Discret. Math. 263, 179\u2013190 (2003)","journal-title":"Discret. Math."},{"key":"9461_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/110823560","volume":"26","author":"VE Levit","year":"2012","unstructured":"Levit, V.E., Mandrescu, E.: Vertices belonging to all critical independent sets of a graph. SIAM J. Discret. Math. 26, 399\u2013403 (2012)","journal-title":"SIAM J. Discret. Math."},{"key":"9461_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00373-011-1037-y","volume":"28","author":"VE Levit","year":"2012","unstructured":"Levit, V.E., Mandrescu, E.: Critical independent sets and K\u00f6nig-Egerv\u00e1ry graphs. Graphs and Combinatorics 28, 243\u2013250 (2012)","journal-title":"Graphs and Combinatorics"},{"key":"9461_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.26493\/1855-3974.201.6e1","volume":"5","author":"VE Levit","year":"2012","unstructured":"Levit, V.E., Mandrescu, E.: On the core of a unicyclic graph. Ars Mathematica Contemporanea 5, 325\u2013331 (2012)","journal-title":"Ars Mathematica Contemporanea"},{"key":"9461_CR14","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s00026-013-0195-4","volume":"17","author":"VE Levit","year":"2013","unstructured":"Levit, V.E., Mandrescu, E.: Critical sets in bipartite graphs. Ann. Comb. 17, 543\u2013548 (2013)","journal-title":"Ann. Comb."},{"key":"9461_CR15","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.disc.2012.12.008","volume":"313","author":"VE Levit","year":"2013","unstructured":"Levit, V.E., Mandrescu, E.: On the structure of the minimum critical independent set of a graph. Discret. Math. 313, 605\u2013610 (2013)","journal-title":"Discret. Math."},{"key":"9461_CR16","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1016\/j.dam.2013.01.005","volume":"161","author":"VE Levit","year":"2013","unstructured":"Levit, V.E., Mandrescu, E.: On maximum matchings in K\u00f6nig-Egerv\u00e1ry graphs. Discret. Appl. Math. 161, 1635\u20131638 (2013)","journal-title":"Discret. Appl. Math."},{"key":"9461_CR17","doi-asserted-by":"crossref","first-page":"#P1.40","DOI":"10.37236\/2514","volume":"21","author":"VE Levit","year":"2014","unstructured":"Levit, V.E., Mandrescu, E.: A set and collection lemma. Electron. J. Comb. 21, #P1.40 (2014)","journal-title":"Electron. J. Comb."},{"key":"9461_CR18","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.dam.2013.09.006","volume":"162","author":"VE Levit","year":"2014","unstructured":"Levit, V.E., Mandrescu, E.: On the intersection of all critical sets of a unicyclic graph. Discret. Appl. Math. 162, 409\u2013414 (2014)","journal-title":"Discret. Appl. Math."},{"key":"9461_CR19","doi-asserted-by":"crossref","first-page":"#P2.43","DOI":"10.37236\/5580","volume":"23","author":"T Short","year":"2016","unstructured":"Short, T.: On some conjectures concerning critical independent sets of a graph. Electron. J. Comb. 23, #P2.43 (2016)","journal-title":"Electron. J. Comb."},{"key":"9461_CR20","volume-title":"Algebraic Topology","author":"EH Spanier","year":"1966","unstructured":"Spanier, E.H.: Algebraic Topology. Springer, Berlin (1966)"},{"key":"9461_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","volume":"27","author":"F Sterboul","year":"1979","unstructured":"Sterboul, F.: A characterization of the graphs in which the transversal number equals the matching number. Journal of Combinatorial Theory B 27, 228\u2013229 (1979)","journal-title":"Journal of Combinatorial Theory B"},{"key":"9461_CR22","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0403037","volume":"3","author":"CQ Zhang","year":"1990","unstructured":"Zhang, C.Q.: Finding critical independent sets and critical vertex subsets are polynomial problems. SIAM J. Discret. Math. 3, 431\u2013438 (1990)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-018-9461-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-018-9461-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-018-9461-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T00:14:01Z","timestamp":1604535241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-018-9461-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9461"],"URL":"https:\/\/doi.org\/10.1007\/s11083-018-9461-8","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,3]]},"assertion":[{"value":"2 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}