{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T08:27:59Z","timestamp":1768465679751,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00373-022-02567-y","type":"journal-article","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T17:03:10Z","timestamp":1663002190000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Trung Duy","family":"Doan","sequence":"first","affiliation":[]},{"given":"Pham Hoang","family":"Ha","sequence":"additional","affiliation":[]},{"given":"Ingo","family":"Schiermeyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"key":"2567_CR1","first-page":"189","volume":"97","author":"E Andrews","year":"2016","unstructured":"Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: On proper-path colorings in graphs. J. Combin. Math. Combin. Comput. 97, 189\u2013207 (2016)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2567_CR2","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s00373-017-1796-1","volume":"33","author":"C Brause","year":"2017","unstructured":"Brause, C., Doan, T.D., Schiermeyer, I.: Minimum degree conditions for the proper connection number of graphs. Graphs Combin. 33, 833\u2013843 (2017). https:\/\/doi.org\/10.1007\/s00373-017-1796-1","journal-title":"Graphs Combin."},{"key":"2567_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.endm.2016.10.028","volume":"55","author":"C Brause","year":"2016","unstructured":"Brause, C., Doan, T.D., Schiermeyer, I.: On the minimum degree and the proper connection number of graphs. Electron. Notes Discrete Math. 55, 109\u2013112 (2016)","journal-title":"Electron. Notes Discrete Math."},{"key":"2567_CR4","doi-asserted-by":"publisher","first-page":"2550","DOI":"10.1016\/j.disc.2011.09.003","volume":"312","author":"V Borozan","year":"2012","unstructured":"Borozan, V., Fujita, S., Gerek, A., Magnant, C., Manoussakis, Y., Montero, L., Tuza, Z.: Proper connection of graphs. Discrete Math. 312, 2550\u20132560 (2012)","journal-title":"Discrete Math."},{"issue":"1","key":"2567_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G Chartrand","year":"2008","unstructured":"Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Math. Bohemica 133(1), 85\u201398 (2008)","journal-title":"Math. Bohemica"},{"issue":"2","key":"2567_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.akcej.2016.06.003","volume":"13","author":"E Chizmar","year":"2016","unstructured":"Chizmar, E., Magnant, C., Nowbandegani, P.S.: Note on vertex and total proper connection numbers. AKCE Int. J. Graphs Combin. 13(2), 103\u2013106 (2016)","journal-title":"AKCE Int. J. Graphs Combin."},{"key":"2567_CR7","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":"4","key":"2567_CR8","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"},{"issue":"35","key":"2567_CR9","doi-asserted-by":"publisher","first-page":"4531","DOI":"10.1016\/j.tcs.2011.04.032","volume":"412","author":"L Chen","year":"2011","unstructured":"Chen, L., Li, X., Shi, Y.: The complexity of determining the rainbow vertex-connection of a graph. Theor. Comput. Sci. 412(35), 4531\u20134535 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"2567_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.7151\/dmgt.2211","volume":"41","author":"TD Doan","year":"2021","unstructured":"Doan, T.D., Schiermeyer, I.: Conflict-free vertex connection number at most $$3$$ and size of graphs. Discuss. Math. Graph Theory 41, 617\u2013632 (2021)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2567_CR11","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 Combin. 37, 1859\u20131871 (2021)","journal-title":"Graphs Combin."},{"issue":"1","key":"2567_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s40840-015-0271-5","volume":"41","author":"H Jiang","year":"2018","unstructured":"Jiang, H., Li, X., Zhang, Y., Zhao, Y.: On (Strong) proper vertex-connection of graphs. Bull. Malays. Math. Sci. Soc. 41(1), 415\u2013425 (2018)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"3","key":"2567_CR13","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M Krivelevich","year":"2010","unstructured":"Krivelevich, M., Yuster, R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63(3), 185\u2013191 (2010)","journal-title":"J. Graph Theory"},{"key":"2567_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs: a survey. Graphs Combin. 29, 1\u201338 (2013)","journal-title":"Graphs Combin."},{"key":"2567_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow Connections of Graphs. Springer Briefs in Mathematics","author":"X Li","year":"2012","unstructured":"Li, X., Sun, Y.: Rainbow Connections of Graphs. Springer Briefs in Mathematics. Springer, New York (2012)"},{"key":"2567_CR16","doi-asserted-by":"crossref","unstructured":"Li, X., Magnant, C.: Properly colored notions of connectivity\u2014a dynamic survey. Theory Appl. Graphs 0(1) (2015) (Art. 2)","DOI":"10.20429\/tag.2015.000102"},{"key":"2567_CR17","doi-asserted-by":"crossref","unstructured":"Li, X., Zhang, Y., Zhu, X., Mao, Y., Zhao, H., Jendrol\u2019, S.: Conflict-free vertex-connections of graphs. Discuss. Math. Graph Theory 40, 51\u201365 (2020)","DOI":"10.7151\/dmgt.2116"},{"key":"2567_CR18","doi-asserted-by":"crossref","unstructured":"Li, Z., Wu, B.: On the maximum value of conflict-free vertex-connection number of graphs. Discrete Math. Algor. Appl. 10(05) (2018)","DOI":"10.1142\/S1793830918500593"},{"key":"2567_CR19","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Hoboken (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02567-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02567-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02567-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T21:25:08Z","timestamp":1701033908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02567-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,12]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2567"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02567-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,12]]},"assertion":[{"value":"27 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"157"}}