{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T16:46:59Z","timestamp":1750956419355},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p> Let G be a simple graph containing a perfect matching. G is said to be bipartite matching extendable (BM-extendable) if every matching M which is a perfect matching of an induced bipartite subgraph extends to a perfect matching of G. In this paper, we study some relations between toughness and BM-extendability of a graph, including some sufficient or necessary conditions about toughness for a graph to be BM-extendable, and a sufficient condition for a BM-extendable graph to be 1-tough. <\/jats:p>","DOI":"10.1142\/s1793830910000450","type":"journal-article","created":{"date-parts":[[2010,4,20]],"date-time":"2010-04-20T09:35:00Z","timestamp":1271756100000},"page":"33-44","source":"Crossref","is-referenced-by-count":2,"title":["BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS"],"prefix":"10.1142","volume":"02","author":[{"given":"XIUMEI","family":"WANG","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SUJING","family":"ZHOU","sequence":"additional","affiliation":[{"name":"Zhengzhou Railway Vocational and Technical College, Zhengzhou 450052, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YIXUN","family":"LIN","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-006-0649-0"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90138-6"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1022"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00328-9"},{"key":"rf6","volume-title":"Matching Theory","author":"Lovasz L.","year":"1986"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90037-0"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90221-X"},{"key":"rf12","first-page":"295","volume":"90","author":"Wang X. M.","journal-title":"Ars Combinatoria"},{"key":"rf13","first-page":"55","volume":"7","author":"Yu Q. L.","journal-title":"Australas. J. Combin."},{"key":"rf14","first-page":"203","volume":"28","author":"Yuan J. J.","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:23:10Z","timestamp":1565140990000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1142\/S1793830910000450"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000450","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}