{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T08:17:51Z","timestamp":1774513071462,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T00:00:00Z","timestamp":1634256000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T00:00:00Z","timestamp":1634256000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201806220051"],"award-info":[{"award-number":["201806220051"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Grant for Overseas Challenge Program for Young Researchers from JSPS","award":["201980222"],"award-info":[{"award-number":["201980222"]}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP20J15332"],"award-info":[{"award-number":["JP20J15332"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00824-z","type":"journal-article","created":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T19:44:00Z","timestamp":1634327040000},"page":"154-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximum properly colored trees in edge-colored graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Jie","family":"Hu","sequence":"first","affiliation":[]},{"given":"Hao","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1607-8665","authenticated-orcid":false,"given":"Shun-ichi","family":"Maezawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,15]]},"reference":[{"key":"824_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/jgt.20204","volume":"54","author":"S Akbari","year":"2006","unstructured":"Akbari S, Alipour A (2006) Multicolored trees in complete graphs. J Graph Theory 54:221\u2013232","journal-title":"J Graph Theory"},{"key":"824_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-P","volume":"11","author":"N Alon","year":"1997","unstructured":"Alon N, Gutin G (1997) Properly colored Hamilton cycles in edge-colored complete graphs. Random Struct Algorithms 11:179\u2013186","journal-title":"Random Struct Algorithms"},{"key":"824_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0166-218X(97)00062-0","volume":"82","author":"J Bang-Jensen","year":"1998","unstructured":"Bang-Jensen J, Gutin G, Yeo A (1998) Properly coloured Hamiltonian paths in edge-coloured complete graphs. Discrete Appl Math 82:247\u2013250","journal-title":"Discrete Appl Math"},{"key":"824_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BF02756791","volume":"23","author":"B Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s B, Erd\u0151s P (1976) Alternating Hamiltonian cycles. Israel J Math 23:126\u2013131","journal-title":"Israel J Math"},{"key":"824_CR5","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ejc.2018.02.027","volume":"80","author":"V Borozan","year":"2019","unstructured":"Borozan V, Fernandez de La Vega W, Manoussakis Y, Martinhon C, Muthu R, Pham HP, Saad R (2019) Maximum colored trees in edge-colored graphs. Euro J Combin 80:296\u2013310","journal-title":"Euro J Combin"},{"key":"824_CR6","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1006\/jctb.1996.0071","volume":"68","author":"RA Brualdi","year":"1996","unstructured":"Brualdi RA, Hollingsworth S (1996) Multicolored trees in complete graphs. J Combin Theory Ser B 68:310\u2013313","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"824_CR7","doi-asserted-by":"publisher","first-page":"111629","DOI":"10.1016\/j.disc.2019.111629","volume":"343","author":"Y Cheng","year":"2020","unstructured":"Cheng Y, Kano M, Wang G (2020) Properly colored spanning trees in edge-colored graphs. Discrete Math 343(1):111629","journal-title":"Discrete Math"},{"issue":"4","key":"824_CR8","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1016\/j.disc.2019.01.002","volume":"342","author":"Y Cheng","year":"2019","unstructured":"Cheng Y, Sun Q, Tan TS, Wang G (2019) Rainbow Hamiltonian cycles in strongly edge-colored graphs. Discrete Math 342(4):1186\u20131190","journal-title":"Discrete Math"},{"issue":"1","key":"824_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac GA (1952) Some theorems on abstract graphs. Proc London Math Soc 2(1):69\u201381","journal-title":"Proc London Math Soc"},{"key":"824_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/jgt.20188","volume":"53","author":"J Feng","year":"2006","unstructured":"Feng J, Giesen H, Guo Y, Gutin G, Jensen T, Rafiey A (2006) Characterization of edge-colored complete graphs with properly colored Hamilton paths. J Graph Theory 53:333\u2013346","journal-title":"J Graph Theory"},{"key":"824_CR11","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1016\/j.dam.2011.06.005","volume":"159","author":"S Fujita","year":"2011","unstructured":"Fujita S, Magnant C (2011) Properly colored paths and cycles. Discrete Appl Math 159:1391\u20131397","journal-title":"Discrete Appl Math"},{"key":"824_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/jgt.22160","volume":"87","author":"P Horn","year":"2018","unstructured":"Horn P (2018) Rainbow spanning trees in complete graphs colored by one-factorizations. J Graph Theory 87:333\u2013346","journal-title":"J Graph Theory"},{"key":"824_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00373-008-0789-5","volume":"24","author":"M Kano","year":"2008","unstructured":"Kano M, Li X (2008) Monochromatic and heterochromatic subgraphs in edge-colored graphs\u2014a survey. Graphs Combin 24:237\u2013263","journal-title":"Graphs Combin"},{"issue":"1","key":"824_CR14","doi-asserted-by":"publisher","first-page":"P1.13","DOI":"10.37236\/3628","volume":"22","author":"M Kano","year":"2015","unstructured":"Kano M, Ozeki K, Suzuki K, Tsugaki M, Yamashita T (2015) Spanning $$k$$-trees of bipartite graphs. Electron J Combin 22(1):P1.13","journal-title":"Electron J Combin"},{"key":"824_CR15","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1016\/j.disc.2012.11.024","volume":"313","author":"H Li","year":"2013","unstructured":"Li H (2013) Rainbow $$C^{\\prime }_3$$s and $$C^{\\prime }_4$$s in edge-colored graphs. Discrete Math 313:1893\u20131896","journal-title":"Discrete Math"},{"key":"824_CR16","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1007\/s00373-016-1690-2","volume":"32","author":"R Li","year":"2016","unstructured":"Li R, Ning B, Zhang S (2016) Color degree sum conditions for rainbow triangles in edge-colored graphs. Graphs Combin 32:2001\u20132008","journal-title":"Graphs Combin"},{"issue":"8","key":"824_CR17","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1016\/j.ejc.2012.06.005","volume":"33","author":"H Li","year":"2012","unstructured":"Li H, Wang G (2012) Color degree and heterochromatic cycles in edge-colored graphs. Euro J Combin 33(8):1958\u20131964","journal-title":"Euro J Combin"},{"key":"824_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/jgt.21751","volume":"76","author":"A Lo","year":"2014","unstructured":"Lo A (2014) A Dirac type condition for properly coloured paths and cycles. J Graph Theory 76:60\u201387","journal-title":"J Graph Theory"},{"issue":"4","key":"824_CR19","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00493-015-3067-1","volume":"36","author":"A Lo","year":"2016","unstructured":"Lo A (2016) Properly colored Hamiltonian cycles in edge-colored complete graphs. Combinatorica 36(4):471\u2013492","journal-title":"Combinatorica"},{"key":"824_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22405","author":"A Lo","year":"2018","unstructured":"Lo A (2018) Long properly coloured cycles in edge-coloured graphs. J Graph Theory. https:\/\/doi.org\/10.1002\/jgt.22405","journal-title":"J Graph Theory"},{"key":"824_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore O (1960) Note on Hamilton circuits. Am Math Monthly 67:55","journal-title":"Am Math Monthly"},{"key":"824_CR22","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00373-006-0662-3","volume":"22","author":"K Suzuki","year":"2006","unstructured":"Suzuki K (2006) A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph. Graphs Combin 22:261\u2013269","journal-title":"Graphs Combin"},{"key":"824_CR23","doi-asserted-by":"publisher","first-page":"4349","DOI":"10.1016\/j.disc.2009.01.016","volume":"309","author":"G Wang","year":"2009","unstructured":"Wang G, Li H (2009) Color degree and alternating cycles in edge-colored graphs. Discrete Math 309:4349\u20134354","journal-title":"Discrete Math"},{"key":"824_CR24","doi-asserted-by":"publisher","first-page":"P162","DOI":"10.37236\/649","volume":"18","author":"G Wang","year":"2011","unstructured":"Wang G (2011) Rainbow matchings in properly edge colored graphs. Electron J Combin 18:P162","journal-title":"Electron J Combin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00824-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00824-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00824-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:27:09Z","timestamp":1659079629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00824-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,15]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["824"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00824-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,15]]},"assertion":[{"value":"5 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}