{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:42Z","timestamp":1759638282021,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10878-018-0363-x","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T02:44:47Z","timestamp":1542768287000},"page":"340-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Conflict-free connection of trees"],"prefix":"10.1007","volume":"42","author":[{"given":"Hong","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8335-9873","authenticated-orcid":false,"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingshu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"363_CR1","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/1383369.1383375","volume":"4","author":"A Bar-Noy","year":"2008","unstructured":"Bar-Noy A, Cheilaris P, Smorodinsky S (2008) Deterministic conflict-free coloring for intervals: from offline to online. ACM Trans Algorithms 4:44:1\u201344:18","journal-title":"ACM Trans Algorithms"},{"issue":"1","key":"363_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender HL, Deogun JS, Jansen K, Kloks T, Kratsch D, M\u00fcller H, Tuza Z (1998) Rankings of graphs. SIAM J Discret Math 11(1):168\u2013181","journal-title":"SIAM J Discret Math"},{"key":"363_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 JA, Murty USR (2008) Graph theory, GTM 244. Springer, Berlin"},{"key":"363_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.7151\/dmgt.1537","volume":"31","author":"P Borowiecki","year":"2011","unstructured":"Borowiecki P, Budajov\u00e1 K, Jendroll\u2019 S, Kraj\u010d S (2011) Parity vertex colouring of graphs. Discuss Math Gr Theory 31:183\u2013195","journal-title":"Discuss Math Gr Theory"},{"key":"363_CR5","doi-asserted-by":"publisher","unstructured":"Chang H, Huang Z, Li X, Mao Y, Zhao H (2018) On conflict-free connection of graphs, Discrete Appl. Math. https:\/\/doi.org\/10.1016\/j.dam.2018.08.006","DOI":"10.1016\/j.dam.2018.08.006"},{"key":"363_CR6","unstructured":"Cheilaris P (2009) Conflict-free coloring. PhD. thesis, City University of New York, New York"},{"key":"363_CR7","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 (2011) Graph unique-maximum and conflict-free colorings. J Discret Algorithms 9:241\u2013251","journal-title":"J Discret Algorithms"},{"key":"363_CR8","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 (2013) Unique-maximum and conflict-free coloring for hypergraphs and tree graphs. SIAM J. Discrete Math. 27:1775\u20131787","journal-title":"SIAM J. Discrete Math."},{"key":"363_CR9","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1137\/S0097539704446682","volume":"36","author":"K Chen","year":"2006","unstructured":"Chen K, Fiat A, Kaplan H, Levy M, Matou\u0161ek J, Mossel E, Pach J, Sharir M, Smorodinsky S, Wagner U, Welzl E (2006) Online conflict-free coloring for intervals. SIAM J Comput 36:1342\u20131359","journal-title":"SIAM J Comput"},{"issue":"4","key":"363_CR10","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 (2018) Conflict-free connection of graphs. Discuss Math Gr Theory 38(4):911\u2013920","journal-title":"Discuss Math Gr Theory"},{"key":"363_CR11","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF01189071","volume":"13","author":"P de la Torre","year":"1995","unstructured":"de la Torre P, Geenlaw R, Sch\u00e4ffer AA (1995) Optimal edge ranking of trees in polynomial time. Algorithmica 13:529\u2013618","journal-title":"Algorithmica"},{"key":"363_CR12","doi-asserted-by":"crossref","unstructured":"Deng B, Li W, Li X, Mao Y, Zhao H (2017) Conflict-free connection numbers of line graphs. In: Proceedings of the COCOA 2017, Shanghai, China, Lecture Notes in Computer Science No. 10627, pp 141\u2013151","DOI":"10.1007\/978-3-319-71150-8_14"},{"key":"363_CR13","doi-asserted-by":"crossref","unstructured":"Elbassioni K, Mustafa NH (2006) Conflict-free colorings of rectangles ranges. In: Proceedings of the 23rd international symposium on theoretical aspects of computer science (STACS), Springer, Berlin, 2006, pp 254\u2013263","DOI":"10.1007\/11672142_20"},{"key":"363_CR14","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 (2003) Conflict-free coloring of simple geometic regions with applications to frequency assignment in cellular networks. SIAM J Comput 33:94\u2013136","journal-title":"SIAM J Comput"},{"key":"363_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7151\/dmgt.1595","volume":"32","author":"P Gregor","year":"2012","unstructured":"Gregor P, \u0160rekovski R (2012) Parity vertex colorings of binomial trees. Discuss Math Gr Theory 32:177\u2013180","journal-title":"Discuss Math Gr Theory"},{"key":"363_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00454-005-1162-6","volume":"34","author":"S Har-Peled","year":"2005","unstructured":"Har-Peled S, Smorodinsky S (2005) Conflict-free coloring of points and simple regions in the plane. Discret Comput Geom 34:47\u201370","journal-title":"Discret Comput Geom"},{"key":"363_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"AV Iyer","year":"1991","unstructured":"Iyer AV, Ratliff HD, Vijayan G (1991) On an edge ranking problem of trees and graphs. Discret Appl Math 30:43\u201352","journal-title":"Discret Appl Math"},{"key":"363_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0166-218X(98)00029-8","volume":"85","author":"TW Lam","year":"1998","unstructured":"Lam TW, Yue FL (1998) Edge ranking of graphs is hard. Discret Appl Math 85:71\u201386","journal-title":"Discret Appl Math"},{"key":"363_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s004530010076","volume":"30","author":"TW Lam","year":"2001","unstructured":"Lam TW, Yue FL (2001) Optimal edge ranking of trees in linear time. Algorithmica 30:12\u201333","journal-title":"Algorithmica"},{"key":"363_CR20","first-page":"30","volume":"1","author":"X Li","year":"2015","unstructured":"Li X, Magnant C (2015) Properly colored notions of connectivity-a dynamic survey. Theory Appl Gr 1:30","journal-title":"Theory Appl Gr"},{"key":"363_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow connections of graphs. Springer briefs in math","author":"X Li","year":"2012","unstructured":"Li X, Sun Y (2012) Rainbow connections of graphs. Springer briefs in math. Springer, New York"},{"key":"363_CR22","first-page":"67","volume":"1","author":"X Li","year":"2017","unstructured":"Li X, Sun Y (2017) An updated survey on rainbow connections of graphs-a dynamic survey. Theory Appl Gr 1:67","journal-title":"Theory Appl Gr"},{"key":"363_CR23","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 (2013) Rainbow connections of graphs: a survey. Gr Combin 29:1\u201338","journal-title":"Gr Combin"},{"key":"363_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89617-5","volume-title":"Properly colored connectivity of graphs. Springer briefs in math","author":"X Li","year":"2018","unstructured":"Li X, Magnant C, Qin Z (2018) Properly colored connectivity of graphs. Springer briefs in math. Springer, Berlin"},{"key":"363_CR25","unstructured":"Li Z, Wu B On the maximum value of conflict-free vertex-connection number of graphs. arXiv:1709.01225 [math.CO]"},{"key":"363_CR26","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1017\/S0963548309990290","volume":"18","author":"J Pach","year":"2009","unstructured":"Pach J, Tardos G (2009) Conflict-free colourings of graphs and hypergraphs. Comb Probab Comput 18:819\u2013834","journal-title":"Comb Probab Comput"},{"key":"363_CR27","first-page":"665","volume-title":"Conflict free colorings, discrete and computational geometry","author":"J Pach","year":"2003","unstructured":"Pach J, T\u00f3th G (2003) Conflict free colorings, discrete and computational geometry. Springer, Berlin, pp 665\u2013671"},{"key":"363_CR28","first-page":"331","volume-title":"Geometry-intuitive, discrete, and convex","author":"S Smorodinsky","year":"2013","unstructured":"Smorodinsky S (2013) Conflict-free coloring and its applications. In: B\u00e1r\u00e1ny I et al (eds) Geometry-intuitive, discrete, and convex. Springer, Berlin, pp 331\u2013389"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0363-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-018-0363-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0363-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T06:30:31Z","timestamp":1635575431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-018-0363-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,21]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0363-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,11,21]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}