{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:37:51Z","timestamp":1768549071577,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1954-0","type":"journal-article","created":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T10:15:34Z","timestamp":1539771334000},"page":"1553-1563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Graphs with Conflict-Free Connection Number Two"],"prefix":"10.1007","volume":"34","author":[{"given":"Hong","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trung Duy","family":"Doan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislav","family":"Jendrol\u2019","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Schiermeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"1954_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. Comb. Math. Comb. Comput. 97, 189\u2013207 (2016)","journal-title":"J. Comb. Math. Comb. Comput."},{"issue":"11","key":"1954_CR2","doi-asserted-by":"publisher","first-page":"2673","DOI":"10.1016\/j.disc.2016.09.021","volume":"340","author":"SA Aardt van","year":"2017","unstructured":"van Aardt, S.A., Brause, C., Burger, A.P., Frick, M., Kemnitz, A., Schiermeyer, I.: Proper connection and size of graphs. Discrete Math. 340(11), 2673\u20132677 (2017)","journal-title":"Discrete Math."},{"key":"1954_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory, GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 244. Springer, New York (2008)"},{"key":"1954_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."},{"key":"1954_CR5","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s00373-017-1796-1","volume":"33","author":"C Brause","year":"2017","unstructured":"Brause, C., Duy Doan, T., Schiermeyer, I.: Minimum degree conditions for the proper connection number of graphs. Graphs Comb. 33, 833\u2013843 (2017)","journal-title":"Graphs Comb."},{"key":"1954_CR6","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 [math.CO]"},{"key":"1954_CR7","doi-asserted-by":"crossref","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. Bohem. 133, 85\u201398 (2008)","journal-title":"Math. Bohem."},{"key":"1954_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 connection of graphs. Discuss. Math. Graph Theory 38, 911\u2013920 (2018)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1954_CR9","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\u00f6lgyi, D.: Unique-maximum and conflict-free coloring for hypergraphs and tree graphs. SIAM J. Discrete Math. 27, 1775\u20131787 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"1954_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jda.2011.03.005","volume":"9","author":"P Cheilaris","year":"2011","unstructured":"Cheilaris, P., T\u00f3th, G.: Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9, 241\u2013251 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"1954_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-71150-8_14","volume":"No.10627","author":"B Deng","year":"2017","unstructured":"Deng, B., Li, W., Li, X., Mao, Y., Zhao, H.: Conflict-free connection numbers of line graphs, graphs. Lect. Notes Comput. Sci. No.10627, 141\u2013151 (2017)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1954_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1137\/S0097539702431840","volume":"33","author":"G Even","year":"2003","unstructured":"Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free coloring of simple geometic regions with applications to frequency assignment in cellular networks. SIAM J. Comput. 33, 94\u2013136 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1954_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.tcs.2015.10.017","volume":"609","author":"R Gu","year":"2016","unstructured":"Gu, R., Li, X., Qin, Z.: Proper connection number of random graphs. Theor. Comput. Sci. 609(2), 336\u2013343 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"1954_CR14","doi-asserted-by":"publisher","unstructured":"Huang, F., Li, X., Qin, Z., Magnant, C.: Minimum degree condition for proper connection number 2. Theor. Comput. Sci. https:\/\/doi.org\/10.1016\/j.tcs.2016.04.042 (in press)","DOI":"10.1016\/j.tcs.2016.04.042"},{"issue":"2","key":"1954_CR15","doi-asserted-by":"publisher","first-page":"439","DOI":"10.7151\/dmgt.1867","volume":"36","author":"E Laforge","year":"2016","unstructured":"Laforge, E., Lumduanhom, C., Zhang, P.: Characterizations of graphs having large proper connection numbers. Discuss. Math. Graph Theory 36(2), 439\u2013453 (2016)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1954_CR16","doi-asserted-by":"publisher","unstructured":"Li, X., Magnant, C.: Properly colored notions of connectivity\u2013a dynamic survey. Theory Appl. Graphs. (1) (2015). https:\/\/doi.org\/10.20429\/tag.2015.000102 (Art. 2)","DOI":"10.20429\/tag.2015.000102"},{"key":"1954_CR17","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 Comb. 29, 1\u201338 (2013)","journal-title":"Graphs Comb."},{"key":"1954_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow Connections of Graphs","author":"X Li","year":"2012","unstructured":"Li, X., Sun, Y.: Rainbow Connections of Graphs. Springer Briefs in Math, Springer, New York (2012)"},{"issue":"01","key":"1954_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.20429\/tag.2017.000103","volume":"00","author":"Xueliang Li","year":"2017","unstructured":"Li, X., Sun, Y.: An updated survey on rainbow connections of graphs\u2013a dynamic survey. Theory Appl. Graphs (1) (2017). https:\/\/doi.org\/10.20429\/tag.2017.000103 (Art.3)","journal-title":"Theory and Applications of Graphs"},{"key":"1954_CR20","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1017\/S0963548309990290","volume":"18","author":"J Pach","year":"2009","unstructured":"Pach, J., Tardos, G.: Conflict-free colourings of graphs and hypergraphs. Comb. Probab. Comput. 18, 819\u2013834 (2009)","journal-title":"Comb. Probab. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1954-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1954-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1954-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T07:28:33Z","timestamp":1605252513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1954-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1954"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1954-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"13 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}