{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:39:01Z","timestamp":1760819941427},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,9,27]]},"DOI":"10.1007\/s10878-007-9045-9","type":"journal-article","created":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T12:05:51Z","timestamp":1174392351000},"page":"455-463","source":"Crossref","is-referenced-by-count":31,"title":["Maximum k-regular induced subgraphs"],"prefix":"10.1007","volume":"14","author":[{"given":"Domingos M.","family":"Cardoso","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Kami\u0144ski","sequence":"additional","affiliation":[]},{"given":"Vadim","family":"Lozin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"9045_CR1","series-title":"Colloquia mathematica societatis Janos Bolyai","first-page":"185","volume-title":"Combinatorics, vol\u00a0I","author":"FC Bussemaker","year":"1978","unstructured":"Bussemaker FC, Cvetkovi\u0107 DM, Seidel JJ (1978) Graphs related to exceptional root system. In:Hajnal\u00a0A, S\u00f3s V (eds) Combinatorics, vol\u00a0I, Colloquia mathematica societatis Janos Bolyai, vol\u00a018. North-Holland, Amsterdam, pp\u00a0185\u2013191"},{"key":"9045_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K Cameron","year":"1989","unstructured":"Cameron K (1989) Induced matchings. Discret Appl Math 24:97\u2013102","journal-title":"Discret Appl Math"},{"key":"9045_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1017969603632","volume":"21","author":"DM Cardoso","year":"2001","unstructured":"Cardoso DM (2001) Convex quadratic programming approach to the maximum matching problem. J\u00a0Global Optim 21:91\u2013106","journal-title":"J\u00a0Global Optim"},{"key":"9045_CR4","first-page":"41","volume":"23","author":"DM Cardoso","year":"2006","unstructured":"Cardoso DM, Cvetkovi\u0107 DM (2006) Graphs with least eigenvalue \u22122 attaining a convex quadratic upper bound for the stability number. Bull Acad Serbe Sci Arts Cl Sci Math Natur Sci Math 23:41\u201355","journal-title":"Bull Acad Serbe Sci Arts Cl Sci Math Natur Sci Math"},{"key":"9045_CR5","first-page":"869","volume":"120","author":"DM Cardoso","year":"2004","unstructured":"Cardoso DM, Rama P (2004) Equitable bipartions and related results. J\u00a0Math Sci 120:869\u2013880 (special issue: Aveiro seminar on control, optimization and graph theory)","journal-title":"J\u00a0Math Sci"},{"key":"9045_CR6","doi-asserted-by":"crossref","unstructured":"Cardoso DM, Rama P (2007) Spectral results on regular graphs with (k,\u03c4)-regular sets. Discret Math (to\u00a0appear). doi: 10.1016\/j.disc.2005.11.068","DOI":"10.1016\/j.disc.2005.11.068"},{"key":"9045_CR7","volume-title":"Spectra of graphs\u2014theory and application","author":"DM Cvetkovi\u0107","year":"1971","unstructured":"Cvetkovi\u0107 DM, Doob M, Sachs H (1971) Spectra of graphs\u2014theory and application. Academic, New York"},{"key":"9045_CR8","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability. Freeman, San Francisco"},{"key":"9045_CR9","first-page":"127","volume":"76","author":"JP Georges","year":"1990","unstructured":"Georges JP, Halsey MD, Sanaulla AM, Whittlesey MA (1990) Edge domination and graph structure. Congr Numer 76:127\u2013144","journal-title":"Congr Numer"},{"key":"9045_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(93)90084-M","volume":"8","author":"DL Grinstead","year":"1993","unstructured":"Grinstead DL, Slater PJ, Sherwani NA, Holmes ND (1993) Efficient edge domination problems in graphs. Inf Process Lett 8:221\u2013228","journal-title":"Inf Process Lett"},{"key":"9045_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp\u00a085\u2013104"},{"issue":"2","key":"9045_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L (1979) On the Shannon capacity of a graph. IEEE Trans Inf Theory 25(2):1\u20137","journal-title":"IEEE Trans Inf Theory"},{"key":"9045_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(95)00042-9","volume":"18","author":"CJ Luz","year":"1995","unstructured":"Luz CJ (1995) An upper bound on the independence number of a graph computable in polynomial time. Oper Res Lett 18:139\u2013145","journal-title":"Oper Res Lett"},{"key":"9045_CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"LJ Stockmeyer","year":"1982","unstructured":"Stockmeyer LJ, Vazirani VV (1982) NP-completeness of some generalizations of the maximum matching problem. Inf Process Lett 15:14\u201319","journal-title":"Inf Process Lett"},{"key":"9045_CR15","first-page":"83","volume":"20","author":"DM Thompson","year":"1981","unstructured":"Thompson DM (1981) Eigengraphs: constructing strongly regular graphs with block designs. Util Math 20:83\u2013115","journal-title":"Util Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9045-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9045-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9045-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:11Z","timestamp":1559261891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9045-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,21]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,9,27]]}},"alternative-id":["9045"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9045-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,21]]}}}