{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:10:10Z","timestamp":1775099410057,"version":"3.50.1"},"reference-count":37,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010446","name":"Institute for Basic Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010446","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.disc.2026.115131","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T17:54:36Z","timestamp":1774461276000},"page":"115131","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs"],"prefix":"10.1016","volume":"349","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5419-1533","authenticated-orcid":false,"given":"Ruonan","family":"Li","sequence":"first","affiliation":[]},{"given":"Ruhui","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xueli","family":"Su","sequence":"additional","affiliation":[]},{"given":"Shenggui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115131_br0010","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/jgt.22457","article-title":"Rainbow triangles and the Caccetta-H\u00e4ggkvist conjecture","volume":"92","author":"Aharoni","year":"2019","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115131_br0020","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-P","article-title":"Properly colored Hamilton cycles in edge-colored complete graphs","volume":"11","author":"Alon","year":"1997","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.disc.2026.115131_br0030","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00493-007-2182-z","article-title":"Embedding nearly-spanning bounded degree trees","volume":"27","author":"Alon","year":"2007","journal-title":"Combinatorica"},{"key":"10.1016\/j.disc.2026.115131_br0040","series-title":"Proc. Colloq. Tihany 1968","first-page":"11","article-title":"Alternating Hamiltonian circuit in two-coloured complete graphs","author":"Bankfalvi","year":"1968"},{"key":"10.1016\/j.disc.2026.115131_br0050","first-page":"316","article-title":"Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles","volume":"50","author":"Barr","year":"1998","journal-title":"Ars Comb."},{"key":"10.1016\/j.disc.2026.115131_br0060","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.jctb.2022.02.005","article-title":"Trees with few leaves in tournaments","volume":"155","author":"Benford","year":"2022","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115131_br0070","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.jctb.2024.10.001","article-title":"Trees with many leaves in tournaments","volume":"170","author":"Benford","year":"2025","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115131_br0080","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BF02756791","article-title":"Alternating Hamiltonian cycles","volume":"23","author":"Bollob\u00e1s","year":"1976","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.disc.2026.115131_br0090","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.disc.2026.115131_br0100","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.ejc.2018.02.027","article-title":"Maximum colored trees in edge-colored graphs","volume":"80","author":"Borozan","year":"2019","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115131_br0110","doi-asserted-by":"crossref","first-page":"1716","DOI":"10.1112\/blms.13022","article-title":"Almost spanning distance trees in subsets of finite vector spaces","volume":"56","author":"Chakraborti","year":"2024","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.disc.2026.115131_br0120","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0095-8956(76)90053-8","article-title":"Graphs with Hamiltonian cycles having adjacent lines different colors","volume":"21","author":"Chen","year":"1976","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115131_br0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2019.111629","article-title":"Properly colored spanning trees in edge-colored graphs","volume":"343","author":"Cheng","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115131_br0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2021.103436","article-title":"Properly colored short cycles in edge-colored graphs","volume":"100","author":"Ding","year":"2022","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115131_br0150","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s00493-021-4530-9","article-title":"Bounded VC-dimension implies the Schur-Erd\u0151s conjecture","volume":"41","author":"Fox","year":"2021","journal-title":"Combinatorica"},{"key":"10.1016\/j.disc.2026.115131_br0160","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1017\/S0963548319000014","article-title":"Decomposing edge-coloured graphs under colour degree constraints","volume":"28","author":"Fujita","year":"2019","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115131_br0170","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.jctb.2020.03.002","article-title":"Decompositions into isomorphic rainbow spanning trees","volume":"146","author":"Glock","year":"2021","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115131_br0180","series-title":"Graph Theory Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday","first-page":"200","article-title":"Properly coloured cycles and paths: results and open problems","author":"Gutin","year":"2009"},{"key":"10.1016\/j.disc.2026.115131_br0190","author":"Han"},{"key":"10.1016\/j.disc.2026.115131_br0200","series-title":"Rainbow and Properly Colored Subgraphs","author":"Hu","year":"2025"},{"key":"10.1016\/j.disc.2026.115131_br0210","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/s10878-021-00824-z","article-title":"Maximum properly colored trees in edge-colored graphs","volume":"44","author":"Hu","year":"2022","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.disc.2026.115131_br0220","author":"Hyde"},{"key":"10.1016\/j.disc.2026.115131_br0230","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1112\/blms.12343","article-title":"On a rainbow version of Dirac's theorem","volume":"52","author":"Joos","year":"2020","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.disc.2026.115131_br0240","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112042","article-title":"Color degree sum conditions for properly colored spanning trees in edge-colored graphs","volume":"343","author":"Kano","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115131_br0250","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1007\/s00373-021-02334-5","article-title":"Rainbow and properly colored spanning trees in edge-colored bipartite graphs","volume":"37","author":"Kano","year":"2021","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115131_br0260","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.jctb.2022.04.007","article-title":"Spanning trees in dense directed graphs","volume":"156","author":"Kathapurkar","year":"2022","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115131_br0270","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.ejc.2013.09.007","article-title":"Rainbow triangles in edge-colored graphs","volume":"36","author":"Li","year":"2014","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115131_br0280","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112573","article-title":"Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result","volume":"344","author":"Li","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115131_br0290","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1002\/jgt.22536","article-title":"Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs","volume":"94","author":"Li","year":"2020","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115131_br0300","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/j.dam.2020.02.008","article-title":"A classification of edge-colored graphs based on properly colored walks","volume":"283","author":"Li","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115131_br0310","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.jctb.2018.07.007","article-title":"Edges not in any monochromatic copy of a fixed graph","volume":"135","author":"Liu","year":"2019","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115131_br0320","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s00493-015-3067-1","article-title":"Properly coloured Hamiltonian cycles in edge-coloured complete graphs","volume":"36","author":"Lo","year":"2016","journal-title":"Combinatorica"},{"key":"10.1016\/j.disc.2026.115131_br0330","doi-asserted-by":"crossref","DOI":"10.1016\/j.aim.2019.106793","article-title":"Spanning trees in random graphs","volume":"356","author":"Montgomery","year":"2019","journal-title":"Adv. Math."},{"key":"10.1016\/j.disc.2026.115131_br0340","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1002\/rsa.21217","article-title":"Spanning cycles in random directed graphs","volume":"65","author":"Montgomery","year":"2024","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.disc.2026.115131_br0350","series-title":"Research Seminar in Discrete Mathematics","article-title":"Properly-coloured Hamilton cycles and the Bollob\u00e1s-Erd\u0151s conjecture","author":"Montgomery","year":"2025"},{"key":"10.1016\/j.disc.2026.115131_br0360","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(79)90020-7","article-title":"A property of the colored complete graph","volume":"25","author":"Shearer","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115131_br0370","article-title":"Constructive lower bounds on classical multicolor Ramsey numbers","volume":"11","author":"Xu","year":"2004","journal-title":"Electron. J. Comb."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600155X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600155X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:17:16Z","timestamp":1775096236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X2600155X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":37,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0012365X2600155X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115131","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115131","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115131"}}