{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:13:32Z","timestamp":1758824012725},"reference-count":23,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,4]]},"abstract":"<jats:p>Let [Formula: see text] be a family of graphs. The anti-Ramsey number [Formula: see text] for [Formula: see text] in the graph [Formula: see text] is the maximum number of colors in an edge coloring of [Formula: see text] that does not have any rainbow copy of any graph in [Formula: see text]. In this paper, we consider the anti-Ramsey number for matchings in regular bipartite graphs and determine its value under several conditions.<\/jats:p>","DOI":"10.1142\/s1793830917500197","type":"journal-article","created":{"date-parts":[[2017,2,10]],"date-time":"2017-02-10T05:55:11Z","timestamp":1486706111000},"page":"1750019","source":"Crossref","is-referenced-by-count":4,"title":["Anti-Ramsey numbers for matchings in regular bipartite graphs"],"prefix":"10.1142","volume":"09","author":[{"given":"Zemin","family":"Jin","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oothan","family":"Nweit","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaijun","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuling","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"key":"S1793830917500197BIB001","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070112"},{"key":"S1793830917500197BIB002","first-page":"311","volume":"73","author":"Axenovich M.","year":"2004","journal-title":"Ars Combin."},{"key":"S1793830917500197BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20012"},{"key":"S1793830917500197BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.10.002"},{"key":"S1793830917500197BIB005","series-title":"Colloquia Mathematica Societ\u00e1lis J\u00e1nos Bolyai","first-page":"657","volume-title":"Infinite and Finite Sets","volume":"10","author":"Erd\u0151s P.","year":"1973"},{"key":"S1793830917500197BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0891-3"},{"key":"S1793830917500197BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.10.038"},{"key":"S1793830917500197BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.05.012"},{"key":"S1793830917500197BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200022"},{"key":"S1793830917500197BIB010","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2105"},{"key":"S1793830917500197BIB011","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830300590X"},{"key":"S1793830917500197BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.09.002"},{"key":"S1793830917500197BIB013","first-page":"114","volume":"292","author":"Jin Z. M.","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"S1793830917500197BIB014","doi-asserted-by":"crossref","first-page":"R85","DOI":"10.37236\/174","volume":"16","author":"Jin Z. M.","year":"2009","journal-title":"Electron. J. Combin."},{"key":"S1793830917500197BIB015","first-page":"75","volume":"111","author":"Jin Z. M.","year":"2013","journal-title":"Ars Combin."},{"key":"S1793830917500197BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-008-0789-5"},{"key":"S1793830917500197BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.05.011"},{"key":"S1793830917500197BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2009.03.019"},{"key":"S1793830917500197BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/s004930200023"},{"key":"S1793830917500197BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-005-0619-y"},{"key":"S1793830917500197BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.11.057"},{"key":"S1793830917500197BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579162"},{"key":"S1793830917500197BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2015.12.013"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T05:41:53Z","timestamp":1601617313000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":23,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2017,4,13]]},"published-print":{"date-parts":[[2017,4]]}},"alternative-id":["10.1142\/S1793830917500197"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500197","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}