{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:34Z","timestamp":1740099634958,"version":"3.37.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_21","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"280-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Edge-Critical Equimatchable Bipartite Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9591-8671","authenticated-orcid":false,"given":"Yasemin","family":"B\u00fcy\u00fck\u00e7olak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8450-1897","authenticated-orcid":false,"given":"Didem","family":"G\u00f6z\u00fcpek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9547-7375","authenticated-orcid":false,"given":"Sibel","family":"\u00d6zkan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/jgt.22138","volume":"87","author":"S Akbari","year":"2018","unstructured":"Akbari, S., Ghodrati, A.H., Hosseinzadeh, M.A., Iranmanesh, A.: Equimatchable regular graphs. J. Graph Theory 87, 35\u201345 (2018)","journal-title":"J. Graph Theory"},{"key":"21_CR2","unstructured":"Deniz, Z., Ekim, T.: Critical equimatchable graphs. Preprint"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.dam.2018.09.033","volume":"261","author":"Z Deniz","year":"2019","unstructured":"Deniz, Z., Ekim, T.: Edge-stable equimatchable graphs. Discrete Appl. Math. 261, 136\u2013147 (2019)","journal-title":"Discrete Appl. Math."},{"key":"21_CR4","first-page":"185","volume":"46","author":"A Frendrup","year":"2010","unstructured":"Frendrup, A., Hartnell, B., Preben, D.: A note on equimatchable graphs. Australas. J. Comb. 46, 185\u2013190 (2010)","journal-title":"Australas. J. Comb."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/net.3230040207","volume":"4","author":"B Gr\u00fcnbaum","year":"1974","unstructured":"Gr\u00fcnbaum, B.: Matchings in polytopal graphs. Networks 4, 175\u2013190 (1974)","journal-title":"Networks"},{"key":"21_CR6","unstructured":"Lesk, M., Plummer, M.D., Pulleyblank, W.R.: Equi-matchable graphs. In: Graph Theory and Combinatorics (Cambridge, 1983), pp. 239\u2013254. Academic Press, London (1984)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02760842","volume":"18","author":"M Lewin","year":"1974","unstructured":"Lewin, M.: M-perfect and cover-perfect graphs. Israel J. Math. 18, 345\u2013347 (1974)","journal-title":"Israel J. Math."},{"key":"21_CR8","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, vol. 29, Annals of Discrete Mathematics edn. North-Holland, Amsterdam (1986)","edition":"Annals of Discr"},{"key":"21_CR9","unstructured":"Meng, D.H.-C.: Matchings and coverings for graphs. Ph.D. thesis. Michigan State University, East Lansing, MI (1974)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/jgt.3190030209","volume":"3","author":"DP Sumner","year":"1979","unstructured":"Sumner, D.P.: Randomly matchable graphs. J. Graph Theory 3, 183\u2013186 (1979)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:15:22Z","timestamp":1584490522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}