乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:17Z","timestamp":1740122357779,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:00:00Z","timestamp":1633910400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:00:00Z","timestamp":1633910400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871034","11531011"],"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":[[2022,8]]},"DOI":"10.1007\/s10878-021-00820-3","type":"journal-article","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T06:51:04Z","timestamp":1633935064000},"page":"136-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Monochromatic disconnection: Erd\u0151s-Gallai-type problems and product graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Ping","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8335-9873","authenticated-orcid":false,"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"820_CR1","doi-asserted-by":"crossref","unstructured":"Bondy JA, Murty USR (2008) Graph theory, GTM 244, Springer","DOI":"10.1007\/978-1-84628-970-5"},{"key":"820_CR2","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/jgt.20576","volume":"69","author":"P Bonsma","year":"2012","unstructured":"Bonsma P, Farley AM, Proskurowski A (2012) Extremal graphs having no matching cuts. J. Graph Theory 69:206\u2013222","journal-title":"J. Graph Theory"},{"issue":"1","key":"820_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10878-015-9938-y","volume":"33","author":"Q Cai","year":"2017","unstructured":"Cai Q, Li X, Wu D (2017) Erd\u0151s-Gallai-type results for colorful monochromatic connectivity of a graph. J. Comb. Optim. 33(1):123\u2013131","journal-title":"J. Comb. Optim."},{"key":"820_CR4","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1007\/s10878-018-0258-x","volume":"35","author":"Q Cai","year":"2018","unstructured":"Cai Q, Li X, Wu D (2018) Some extremal results on the colorful monochromatic vertex-connectivity of a graph. J. Comb. Optim. 35:1300\u20131311","journal-title":"J. Comb. Optim."},{"key":"820_CR5","doi-asserted-by":"publisher","first-page":"1786","DOI":"10.1016\/j.disc.2011.04.020","volume":"311","author":"Y Caro","year":"2011","unstructured":"Caro Y, Yuster R (2011) Colorful monochromatic connectivity. Discrete Math. 311:1786\u20131792","journal-title":"Discrete Math."},{"issue":"4","key":"820_CR6","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.7151\/dmgt.2061","volume":"38","author":"G Chartrand","year":"2018","unstructured":"Chartrand G, Devereaux S, Haynes TW, Hedetniemi ST, Zhang P (2018) Rainbow disconnection in graphs. Discuss. Math. Graph Theory 38(4):1007\u20131021","journal-title":"Discuss. Math. Graph Theory"},{"issue":"4","key":"820_CR7","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1007\/s40840-015-0274-2","volume":"40","author":"R Gu","year":"2017","unstructured":"Gu R, Li X, Qin Z, Zhao Y (2017) More on the colorful monochromatic connectivity. Bull. Malays. Math. Sci. Soc. 40(4):1769\u20131779","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"4","key":"820_CR8","doi-asserted-by":"publisher","first-page":"775","DOI":"10.7151\/dmgt.2095","volume":"39","author":"H Jiang","year":"2019","unstructured":"Jiang H, Li X, Zhang Y (2019) Erd\u0151s-Gallai-type results for total monochromatic connection of graphs. Discuss. Math. Graph Theory 39(4):775\u2013785","journal-title":"Discuss. Math. Graph Theory"},{"issue":"4","key":"820_CR9","doi-asserted-by":"publisher","first-page":"785","DOI":"10.11650\/tjm\/200102","volume":"24","author":"Z Jin","year":"2020","unstructured":"Jin Z, Li X, Wang K (2020) The monochromatic connectivity of graphs. Taiwanese J. Math. 24(4):785\u2013815","journal-title":"Taiwanese J. Math."},{"key":"820_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.dam.2020.08.032","volume":"288","author":"P Li","year":"2021","unstructured":"Li P, Li X (2021) Monochromatic disconnection of graphs. Discrete Appl. Math. 288:171\u2013179","journal-title":"Discrete Appl. Math."},{"key":"820_CR11","doi-asserted-by":"crossref","unstructured":"Li X, Wu D (2018) A survey on monochromatic connections of graphs. Theory Appl. Graphs 0(1), Art. 4","DOI":"10.20429\/tag.2017.000104"},{"issue":"01","key":"820_CR12","doi-asserted-by":"publisher","first-page":"1650011","DOI":"10.1142\/S1793830916500117","volume":"8","author":"Y Mao","year":"2016","unstructured":"Mao Y, Wang Z, Yanling F, Ye C (2016) Monochromatic connectivity and graph products. Discrete Math. Algorithms Appl. 8(01):1650011","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"4","key":"820_CR13","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.disc.2016.11.016","volume":"340","author":"D Gonzlez-Moreno","year":"2017","unstructured":"Gonzlez-Moreno D, Guevara M, Montellano-Ballesteros JJ (2017) Monochromatic connecting colorings in strongly connected oriented graphs. Discrete Math. 340(4):578\u2013584","journal-title":"Discrete Math."},{"key":"820_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","volume":"13","author":"PM Weichsel","year":"1963","unstructured":"Weichsel PM (1963) The Kronecker product of graphs. Proc. Amer. Math. Soc. 13:47\u201352","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00820-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00820-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00820-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:28:02Z","timestamp":1659079682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00820-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,11]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["820"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00820-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,10,11]]},"assertion":[{"value":"24 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}