{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:49Z","timestamp":1740122449444,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T00:00:00Z","timestamp":1580256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T00:00:00Z","timestamp":1580256000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871256"],"award-info":[{"award-number":["11871256"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10878-020-00530-2","type":"journal-article","created":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T18:02:32Z","timestamp":1580320952000},"page":"915-932","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fractional matching preclusion number of graphs and the perfect matching polytope"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4047-9891","authenticated-orcid":false,"given":"Ruizhi","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5385-6687","authenticated-orcid":false,"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,29]]},"reference":[{"key":"530_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","volume":"6","author":"R Anstee","year":"1985","unstructured":"Anstee R (1985) An algorithmic proof of Tutte\u2019s $$f$$-factor theorem. J Algorithms 6:112\u2013131","journal-title":"J Algorithms"},{"key":"530_CR2","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff G (1946) Tres observaciones sobre el algebra lineal. Rev Univ Nac Tucum\u00e1n (Ser A) 5:147\u2013151","journal-title":"Rev Univ Nac Tucum\u00e1n (Ser A)"},{"key":"530_CR3","first-page":"185","volume":"174","author":"RC Brigham","year":"2005","unstructured":"Brigham RC, Harary F, Violin EC, Yellen J (2005) Perfect matching preclusion. Congr Numer 174:185\u2013192","journal-title":"Congr Numer"},{"key":"530_CR4","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1016\/j.dam.2012.03.014","volume":"12","author":"E Cheng","year":"2012","unstructured":"Cheng E, Lipt\u00e1k L (2012) Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products. Discrete Appl Math 12:1699\u20131716","journal-title":"Discrete Appl Math"},{"key":"530_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/net.20440","volume":"59","author":"E Cheng","year":"2012","unstructured":"Cheng E, Hu P, Jia R, Lipt\u00e1k L (2012a) Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: sufficient conditions. Networks 59:349\u2013356","journal-title":"Networks"},{"key":"530_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.20441","volume":"59","author":"E Cheng","year":"2012","unstructured":"Cheng E, Hu P, Jia R, Lipt\u00e1k L (2012b) Matching preclusion and conditional matching preclusion problems for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars. Networks 59:357\u2013364","journal-title":"Networks"},{"key":"530_CR7","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1016\/j.dam.2012.03.040","volume":"160","author":"E Cheng","year":"2012","unstructured":"Cheng E, Lipman MJ, Lipt\u00e1k L (2012) Matching preclusion and conditional matching preclusion for regular interconnection networks. Discrete Appl Math 160:1936\u20131954","journal-title":"Discrete Appl Math"},{"key":"530_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1080\/17445760.2013.847441","volume":"29","author":"E Cheng","year":"2014","unstructured":"Cheng E, Hu P, Jia R, Lipt\u00e1k L, Scholten B, Voss J (2014) Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs. Int J Parallel Emerg Distrib Syst 29:499\u2013512","journal-title":"Int J Parallel Emerg Distrib Syst"},{"key":"530_CR9","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2015.01.046","volume":"576","author":"E Cheng","year":"2015","unstructured":"Cheng E, Connolly R, Melekian C (2015) Matching preclusion and conditional matching preclusion problems for the folded Petersen cube. Theor Comput Sci 576:30\u201344","journal-title":"Theor Comput Sci"},{"key":"530_CR10","volume-title":"Combinatorial optimization","author":"WJ Cook","year":"1998","unstructured":"Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1998) Combinatorial optimization. Wiley, New York"},{"key":"530_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Maximum matching and a polyhedron with $$0,1$$-vertices. J Res Nat Bur Standards 69B:125\u2013130","journal-title":"J Res Nat Bur Standards"},{"key":"530_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/S0021-9800(70)80006-0","volume":"8","author":"J Folkman","year":"1970","unstructured":"Folkman J, Fulkerson DR (1970) Flows in infinite graphs. J Comb Theory 8:30\u201344","journal-title":"J Comb Theory"},{"key":"530_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399\u2013404","journal-title":"Can J Math"},{"key":"530_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin"},{"key":"530_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall P (1935) On representatives of subsets. J Lond Math Soc 10:26\u201330","journal-title":"J Lond Math Soc"},{"key":"530_CR16","doi-asserted-by":"crossref","unstructured":"Hoffman AJ (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Proceedings of symposia of applied mathematics, vol X, pp 113\u2013127","DOI":"10.1090\/psapm\/010\/0114759"},{"key":"530_CR17","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/j.dam.2013.01.010","volume":"161","author":"X Hu","year":"2013","unstructured":"Hu X, Liu H (2013) The (conditional) matching preclusion for burnt pancake graphs. Discrete Appl Math 161:1481\u20131489","journal-title":"Discrete Appl Math"},{"key":"530_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2011.12.065","volume":"423","author":"M Lacroix","year":"2012","unstructured":"Lacroix M, Mahjoub AR, Martin S, Picouleau C (2012) On the NP-completeness of the perfect matching free subgraph problem. Theor Comput Sci 423:25\u201329","journal-title":"Theor Comput Sci"},{"key":"530_CR19","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.dam.2015.04.001","volume":"190\u2013191","author":"Q Li","year":"2015","unstructured":"Li Q, Shiu WC, Yao H (2015) Matching preclusion for cube-connected cycles. Discrete Appl Math 190\u2013191:118\u2013126","journal-title":"Discrete Appl Math"},{"key":"530_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.dam.2016.02.001","volume":"207","author":"Q Li","year":"2016","unstructured":"Li Q, He J, Zhang H (2016) Matching preclusion for vertex-transitive networks. Discrete Appl Math 207:90\u201398","journal-title":"Discrete Appl Math"},{"key":"530_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/23799927.2016.1249412","volume":"1","author":"R Lin","year":"2016","unstructured":"Lin R, Zhang H (2016) Maximally matched and super matched regular graphs. Int J Comput Math Comput Syst Theory 1:74\u201384","journal-title":"Int J Comput Math Comput Syst Theory"},{"key":"530_CR22","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2017.07.039","volume":"233","author":"R Lin","year":"2017","unstructured":"Lin R, Zhang H (2017) Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs. Discrete Appl Math 233:104\u2013117","journal-title":"Discrete Appl Math"},{"key":"530_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.08.016","author":"R Lin","year":"2019","unstructured":"Lin R, Zhang H, Zhao W (2019) Matching preclusion for direct product of regular graphs. Discrete Appl Math. https:\/\/doi.org\/10.1016\/j.dam.2019.08.016","journal-title":"Discrete Appl Math"},{"key":"530_CR24","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/s10878-016-0077-x","volume":"34","author":"Y Liu","year":"2017","unstructured":"Liu Y, Liu W (2017) Fractional matching preclusion of graphs. J Comb Optim 34:522\u2013533","journal-title":"J Comb Optim"},{"key":"530_CR25","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.09.020","volume":"465","author":"H L\u00fc","year":"2012","unstructured":"L\u00fc H, Li X, Zhang H (2012) Matching preclusion for balanced hypercubes. Theor Comput Sci 465:10\u201320","journal-title":"Theor Comput Sci"},{"key":"530_CR26","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9947-1957-0083725-9","volume":"84","author":"O Ore","year":"1957","unstructured":"Ore O (1957) Graphs and subgraphs. Trans Am Math Soc 84:109\u2013136","journal-title":"Trans Am Math Soc"},{"key":"530_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"MW Padberg","year":"1982","unstructured":"Padberg MW, Rao MR (1982) Odd minimum cut-sets and b-matchings. Math Oper Res 7:67\u201380","journal-title":"Math Oper Res"},{"key":"530_CR28","volume-title":"Fractional graph theory: a rational approach to the theory of graphs","author":"ER Scheinerman","year":"1997","unstructured":"Scheinerman ER, Ullman DH (1997) Fractional graph theory: a rational approach to the theory of graphs. Wiley, New York"},{"key":"530_CR29","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1016\/j.dam.2010.08.017","volume":"158","author":"S Wang","year":"2010","unstructured":"Wang S, Wang R, Lin S, Li J (2010) Matching preclusion for $$k$$-ary $$n$$-cubes. Discrete Appl Math 158:2066\u20132070","journal-title":"Discrete Appl Math"},{"key":"530_CR30","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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00530-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00530-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00530-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:09:39Z","timestamp":1611792579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00530-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,29]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00530-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,1,29]]},"assertion":[{"value":"29 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}