{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:50Z","timestamp":1759335350810},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T00:00:00Z","timestamp":1424476800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00373-015-1529-2","type":"journal-article","created":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T01:30:38Z","timestamp":1424395838000},"page":"2293-2297","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On Tight Components and Anti-Tight Components"],"prefix":"10.1007","volume":"31","author":[{"given":"Changhong","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,21]]},"reference":[{"key":"1529_CR1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1002\/rsa.10062","volume":"21","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Problems and results on judicious partitions. Random Struct. Alg. 21, 414\u2013430 (2002)","journal-title":"Random Struct. Alg."},{"key":"1529_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s003730050035","volume":"15","author":"M Cai","year":"1999","unstructured":"Cai, M., Favaron, O., Li, H.: $$(2, k)$$ ( 2 , k ) -factor-critical graphs and toughness. Graphs Combin. 15, 137\u2013142 (1999)","journal-title":"Graphs Combin."},{"key":"1529_CR3","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. In: Graduate Texts in Mathematics. 4th ed. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"1529_CR4","doi-asserted-by":"crossref","unstructured":"Dos\u0306li\u0107, T.: Mycielskians and matchings. Discuss. Math. Graph Theory 25, 261\u2013266 (2005)","DOI":"10.7151\/dmgt.1279"},{"key":"1529_CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1006\/jctb.1995.1026","volume":"64","author":"P Erd\u0151s","year":"1995","unstructured":"Erd\u0151s, P., F\u00fcredi, Z., Gould, R.J., Gunderson, D.S.: Extremal graphs for intersecting triangles. J. Combin. Theory Ser. B 64, 89\u2013100 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1529_CR6","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.jctb.2013.06.002","volume":"103","author":"C Lee","year":"2013","unstructured":"Lee, C., Loh, P.S., Sudakov, B.: Bisections of graphs. J. Combin. Theory Ser. B 103, 599\u2013629 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1529_CR7","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s00373-008-0816-6","volume":"24","author":"Y Liu","year":"2008","unstructured":"Liu, Y., Yan, G.: Factor-critical graphs with given number of maximum matchings. Graphs Combin. 24, 563\u2013569 (2008)","journal-title":"Graphs Combin."},{"key":"1529_CR8","first-page":"279","volume":"4","author":"L Lov\u00e1sz","year":"1973","unstructured":"Lov\u00e1sz, L.: A note on factor-critical graphs. Studia Sci. Math. Hungar. 4, 279\u2013280 (1973)","journal-title":"Studia Sci. Math. Hungar."},{"key":"1529_CR9","doi-asserted-by":"crossref","unstructured":"Scott, A.: Judicious partitions and related problems. In: Surveys in Combinatorics, The Proceedings of the Twentieth British Combinatorial Conference, Durham, UK, pp. 95\u2013117 (2005)","DOI":"10.1017\/CBO9780511734885.006"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1529-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1529-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1529-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T14:13:59Z","timestamp":1551190439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1529-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,21]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1529"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1529-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,21]]}}}