{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:05:50Z","timestamp":1754107550304},"reference-count":9,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T00:00:00Z","timestamp":1159920000000},"content-version":"vor","delay-in-days":7157,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1987,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Upper bounds are placed on the order of a <jats:italic>k<\/jats:italic>\u2010regular <jats:italic>m<\/jats:italic>\u2010connected graph <jats:italic>G<\/jats:italic> that produce a lower bound on the number of independent edges in <jats:italic>G<\/jats:italic>. As a corollary, we obtain the order of a smallest <jats:italic>k<\/jats:italic>\u2010regular <jats:italic>m<\/jats:italic>\u2010connected graph which has no 1\u2010factor.<\/jats:p>","DOI":"10.1002\/jgt.3190110109","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T09:25:45Z","timestamp":1180430745000},"page":"53-58","source":"Crossref","is-referenced-by-count":8,"title":["Maximum matchings in a regular graph of specified connectivity and bounded order"],"prefix":"10.1002","volume":"11","author":[{"given":"P.","family":"Katerinis","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,4]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graphs and Digraphs","author":"Behzad M.","year":"1979"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.43.9.842"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_5_2","unstructured":"I.Broere G.Chartrand O. R.Oellermann andC. E.Wall On the edge independence number of a regular graph with large edge connectivity to appear."},{"key":"e_1_2_1_6_2","first-page":"173","article-title":"A sufficient condition for graphs with 1\u2010factors","volume":"41","author":"Chartrand G.","year":"1979","journal-title":"Coll. Math."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018371"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392606"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"e_1_2_1_10_2","first-page":"295","article-title":"The smallest graphs without 1\u2010factors","volume":"11","author":"Wallis W. D.","year":"1981","journal-title":"Ars Combinat."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190110109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190110109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T14:36:49Z","timestamp":1697899009000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190110109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["10.1002\/jgt.3190110109"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190110109","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}