{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T19:37:59Z","timestamp":1770838679702,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(01)00183-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:52:51Z","timestamp":1027583571000},"page":"149-161","source":"Crossref","is-referenced-by-count":25,"title":["Combinatorial properties of the family of maximum stable sets of a graph"],"prefix":"10.1016","volume":"117","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":"78","reference":[{"key":"10.1016\/S0166-218X(01)00183-4_BIB1","series-title":"Graph Theory and Algorithms, in: Proc. Symp. Res. Inst. Electr. Comm., Tohoku Univ., Sendai, 1980","first-page":"108","article-title":"Some common properties for regularizable graphs, edge-critical graphs and B-graphs","volume":"Vol. 108","author":"Berge","year":"1981"},{"key":"10.1016\/S0166-218X(01)00183-4_BIB2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","article-title":"Independence numbers of graphs\u2014an extension of the K\u00f6nig\u2013Egerv\u00e1ry theorem","volume":"27","author":"Deming","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB3","first-page":"16","article-title":"On combinatorial properties of matrices","volume":"38","author":"Egerv\u00e1ry","year":"1931","journal-title":"Matematikai Lapok"},{"key":"10.1016\/S0166-218X(01)00183-4_BIB4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(93)90026-K","article-title":"Graphs whose vertex independence number is unaffected by single edge addition or deletion","volume":"46","author":"Gunther","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB5","first-page":"239","article-title":"Changing and unchanging of the graphical invariants: minimum and maximum degree, maximum clique size, node independence number and edge independence number","volume":"72","author":"Haynes","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB6","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/0603052","article-title":"Vertices belonging to all or to no maximum stable sets of a graph","volume":"3","author":"Hammer","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(01)00183-4_BIB7","first-page":"116","article-title":"Graphen and matrizen","volume":"38","author":"K\u00f6nig","year":"1931","journal-title":"Matematikai Lapok"},{"key":"10.1016\/S0166-218X(01)00183-4_BIB8","first-page":"33","article-title":"On \u03b1-stable graphs","volume":"124","author":"Levit","year":"1997","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB9","unstructured":"V.E. Levit, E. Mandrescu, The structure of \u03b1-stable graphs, Discrete Math. (2000) (accepted)."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB10","unstructured":"V.E. Levit, E. Mandrescu, On \u03b1+-stable K\u00f6nig\u2013Egerv\u00e1ry graphs, The Ninth SIAM Conference on Discrete Mathematics, University of Toronto, Canada, 1998, math. CO\/9912022, 1999."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB11","first-page":"209","article-title":"Well-covered and K\u00f6nig\u2013Egerv\u00e1ry graphs","volume":"130","author":"Levit","year":"1998","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB12","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","article-title":"A characterization of the graphs in which the transversal number equals the matching number","volume":"B 27","author":"Sterboul","year":"1979","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0166-218X(01)00183-4_BIB13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/jgt.3190150208","article-title":"The structure and maximum number of maximum independent sets in trees","volume":"15","author":"Zito","year":"1991","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001834?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001834?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:50:59Z","timestamp":1557100259000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X01001834"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00183-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}