{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:38:35Z","timestamp":1754599115435,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T00:00:00Z","timestamp":1681516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T00:00:00Z","timestamp":1681516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12061073"],"award-info":[{"award-number":["12061073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00373-023-02649-5","type":"journal-article","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T17:02:21Z","timestamp":1681578141000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Conflict-Free Connection Number of Graphs with Four Bridges"],"prefix":"10.1007","volume":"39","author":[{"given":"Zhenzhen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7164-3116","authenticated-orcid":false,"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"2649_CR1","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"issue":"4","key":"2649_CR2","doi-asserted-by":"publisher","first-page":"911","DOI":"10.7151\/dmgt.2036","volume":"38","author":"J Czap","year":"2018","unstructured":"Czap, J., Jendrol\u2019, S., Valiska, J.: Conflict-free connections of graphs. Discuss. Math. Graph Theory 38(4), 911\u2013920 (2018)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2649_CR3","unstructured":"Chang, H., Huang, Z., Li, X., Mao, Y., Zhao, H.: Nordhaus\u2013Gaddum-type theorem for conflict-free connection number of graphs. arXiv:1705.08316"},{"key":"2649_CR4","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1007\/s00373-018-1954-0","volume":"34","author":"H Chang","year":"2018","unstructured":"Chang, H., Doan, T.D., Huang, Z., Jendrol\u2019, S., Li, X., Schiermeyer, I.: Graphs with conflict-free connection number two. Graphs Combin. 34, 1553\u20131563 (2018)","journal-title":"Graphs Combin."},{"issue":"3","key":"2649_CR5","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/s10878-018-0363-x","volume":"42","author":"H Chang","year":"2018","unstructured":"Chang, H., Ji, M., Li, X., Zhang, J.: Conflict-free connection of trees. J. Comb. Optim. 42(3), 340\u2013353 (2018)","journal-title":"J. Comb. Optim."},{"key":"2649_CR6","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1137\/120880471","volume":"27","author":"P Cheilaris","year":"2013","unstructured":"Cheilaris, P., Keszegh, B., P\u00e1lv\u00f6igyi, D.: Unique-maximum and conflict-free coloring for hyper-graphs and tree graphs. SIAM J. Discrete Math. 27, 1775\u20131787 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"2649_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-71150-8_14","volume":"10627","author":"B Deng","year":"2017","unstructured":"Deng, B., Li, W., Li, X., Mao, Y., Zhao, H.: Conflict-free connection numbers of line graphs. Lect. Notes Comput. Sci. 10627, 141\u2013151 (2017)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"2","key":"2649_CR8","first-page":"288","volume":"76","author":"X Li","year":"2020","unstructured":"Li, X., Zhu, X.: Conflict-free (vertex)-connection numbers of graphs with small diameters. Australas. J. Comb. 76(2), 288\u2013298 (2020)","journal-title":"Australas. J. Comb."},{"key":"2649_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2020.06.030","volume":"841","author":"F Huang","year":"2020","unstructured":"Huang, F., Li, X.: Hardness results for three kinds of colored connections of graphs. Theoret. Comput. Sci. 841, 27\u201338 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"2649_CR10","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s00373-021-02331-8","volume":"37","author":"TD Doan","year":"2021","unstructured":"Doan, T.D., Schiermeyer, I.: Conflict-free connection number and size of graphs. Graphs Comb. 37, 1859\u20131871 (2021)","journal-title":"Graphs Comb."},{"key":"2649_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.dam.2018.08.006","volume":"255","author":"H Chang","year":"2019","unstructured":"Chang, H., Huang, Z., Li, X., Mao, Y., Zhao, H.: On conflict-free connection of graphs. Discrete Appl. Math. 255, 167\u2013182 (2019)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02649-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02649-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02649-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T17:01:56Z","timestamp":1685293316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02649-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,15]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2649"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02649-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,4,15]]},"assertion":[{"value":"12 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2023","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":"50"}}