{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:15Z","timestamp":1740122355529,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T00:00:00Z","timestamp":1623024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T00:00:00Z","timestamp":1623024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["12061059"],"award-info":[{"award-number":["12061059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10878-021-00766-6","type":"journal-article","created":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T19:03:08Z","timestamp":1623092588000},"page":"253-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A note on maximum fractional matchings of graphs"],"prefix":"10.1007","volume":"43","author":[{"given":"Tianlong","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eddie","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9134-237X","authenticated-orcid":false,"given":"Yaping","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,7]]},"reference":[{"key":"766_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory, GTM 244","author":"J Bondy","year":"2008","unstructured":"Bondy J, Murty USR (2008) Graph theory, GTM 244. Springer, Berlin"},{"issue":"2","key":"766_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/71.577251","volume":"8","author":"K Day","year":"1997","unstructured":"Day K, Al-Ayyoub A-E (1997) The cross product of interconnection networks. IEEE Trans Parallel Distr Syst 8(2):109\u2013118","journal-title":"IEEE Trans Parallel Distr Syst"},{"key":"766_CR3","doi-asserted-by":"crossref","unstructured":"Fragopoulou P, Akl S, Meijer H (1996) Optimal communication primitives on the generalized hypercube network. IEEE Trans Parallel Distr Syst 32(2):173\u2013187","DOI":"10.1006\/jpdc.1996.0012"},{"key":"766_CR4","doi-asserted-by":"crossref","unstructured":"Hammack R, Imrich W, Klavz\u0306ar S, (2011) Handbook of product graphs, Secend edn. CRC Press, Boca Raton","DOI":"10.1201\/b10959"},{"key":"766_CR5","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1002\/net.10047","volume":"40","author":"Y Liu","year":"2002","unstructured":"Liu Y, Liu G (2002) The fractional matching numbers of graphs. Networks 40:228\u2013231","journal-title":"Networks"},{"key":"766_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10878-020-00566-4","volume":"40","author":"Y Liu","year":"2020","unstructured":"Liu Y, Lei M, Su X (2020) Fractional Gallai\u2013Edmonds decomposition and maximal graphs on fractional matching number. J Comb Optim 40:59\u201368","journal-title":"J Comb Optim"},{"key":"766_CR7","volume-title":"Matching theory, Ann Discrete Math","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Plummer M (1986) Matching theory, Ann Discrete Math, vol 29. North-Holland Publishing Co., Amsterdam"},{"key":"766_CR8","volume-title":"Fractional graph theory: a rational approach to the theory of graphs","author":"E Scheinerman","year":"1997","unstructured":"Scheinerman E, Ullman D (1997) Fractional graph theory: a rational approach to the theory of graphs. Wiley, New York"},{"key":"766_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte WT (1947) The factorization of linear graphs. J Lond Math Soc 22:107\u2013111","journal-title":"J Lond Math Soc"},{"key":"766_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2018.06.050","volume":"755","author":"Z Wang","year":"2019","unstructured":"Wang Z, Melekian C, Cheng E, Mao Y (2019) Matching preclusion number in product graphs. Theor Comput Sci 755:38\u201347","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00766-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00766-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00766-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T08:17:20Z","timestamp":1643444240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00766-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,7]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00766-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,6,7]]},"assertion":[{"value":"31 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}