{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:53:23Z","timestamp":1742388803991},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00373-024-02762-z","type":"journal-article","created":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T02:01:52Z","timestamp":1712023312000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some Results on the Rainbow Vertex-Disconnection Colorings of Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Yindi","family":"Weng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,2]]},"reference":[{"issue":"2","key":"2762_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10114-020-0083-x","volume":"37","author":"X Bai","year":"2021","unstructured":"Bai, X., Chen, Y., Li, P., Li, X., Weng, Y.: The rainbow vertex-disconnection in graphs. Acta Math. Sin. (Engl. Ser.) 37(2), 249\u2013261 (2021)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"2762_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory, GTM 224","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 224. Springer, New York (2008)"},{"key":"2762_CR3","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, T.W., Hedetniemi, S.T., Zhang, P.: Rainbow disconnection in graphs. Discuss. Math. Graph Theory 38, 1007\u20131021 (2018)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2762_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10878-011-9386-2","volume":"24","author":"M Chen","year":"2012","unstructured":"Chen, M., Hahn, G., Raspaud, A., Wang, W.: Some results on the injective chromatic number of graphs. J. Comb. Optim. 24, 299\u2013318 (2012)","journal-title":"J. Comb. Optim."},{"key":"2762_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/s10878-021-00742-0","volume":"42","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Li, P., Li, X., Weng, Y.: Complexity results for two kinds of colored disconnections of graphs. J. Comb. Optim. 42, 40\u201355 (2021)","journal-title":"J. Comb. Optim."},{"key":"2762_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"2762_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57(2), 187\u2013199 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"2762_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn, G., Kratochv\u00edl, J., \u0160ir\u00e1\u0148, J., Sotteau, D.: On the injective chromatic number of graphs. Discrete Math. 256, 179\u2013192 (2002)","journal-title":"Discrete Math."},{"key":"2762_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2013.04.026","volume":"491","author":"J Jin","year":"2013","unstructured":"Jin, J., Xu, B., Zhang, X.: On the complexity of injective colorings and its generalizations. Theor. Comput. Sci. 491, 119\u2013126 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2762_CR10","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/jgt.3190190313","volume":"19","author":"M Larsen","year":"1995","unstructured":"Larsen, M., Propp, J., Ullman, D.: The fractional chromatic number of Mycielski\u2019s graphs. J. Graph Theory 19(3), 411\u2013416 (1995)","journal-title":"J. Graph Theory"},{"issue":"5","key":"2762_CR11","doi-asserted-by":"publisher","first-page":"3445","DOI":"10.1007\/s40840-021-01125-8","volume":"44","author":"X Li","year":"2021","unstructured":"Li, X., Weng, Y.: Further results on the rainbow vertex-disconnection of graphs. Bull. Malays. Math. Sci. Soc. 44(5), 3445\u20133460 (2021)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2762_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0012-365X(03)00059-1","volume":"269","author":"K Lih","year":"2003","unstructured":"Lih, K., Wang, W., Zhu, X.: Coloring the square of a $$K_4$$-minor free graph. Discrete Math. 269, 303\u2013309 (2003)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02762-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02762-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02762-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:04:22Z","timestamp":1714241062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02762-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2762"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02762-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"13 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"42"}}