{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:43:09Z","timestamp":1649047389488},"reference-count":8,"publisher":"Elsevier BV","issue":"17","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":1816,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1016\/j.disc.2007.07.085","type":"journal-article","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:18:35Z","timestamp":1188299915000},"page":"3871-3878","source":"Crossref","is-referenced-by-count":4,"title":["Heterochromatic tree partition numbers for complete bipartite graphs"],"prefix":"10.1016","volume":"308","author":[{"given":"He","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zemin","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianhua","family":"Tu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2007.07.085_bib1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0012-365X(98)00323-9","article-title":"Split and balanced colorings of complete graphs","volume":"200","author":"Erd\u00f6s","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2007.07.085_bib2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(91)90007-7","article-title":"Vertex coverings by monochromatic cycles and trees","volume":"51","author":"Erd\u00f6s","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2007.07.085_bib3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.3190070116","article-title":"Vertex coverings by monochromatic paths and cycles","volume":"7","author":"Gy\u00e1rf\u00e1s","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2007.07.085_bib4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/jctb.1997.1737","article-title":"Partitioning complete bipartite graphs by monochromatic cycles","volume":"69","author":"Haxell","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2007.07.085_bib5","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1006\/jctb.1996.0065","article-title":"Partitioning by monochromatic trees","volume":"68","author":"Haxell","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2007.07.085_bib6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/jgt.20044","article-title":"Partitioning complete multipartite graphs by monochromatic trees","volume":"48","author":"Kaneko","year":"2005","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2007.07.085_bib7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1017\/S0963548398003599","article-title":"Partitioning 2-edge-colored complete graphs into 2 monochromatic cycles","volume":"7","author":"Luczak","year":"1998","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.disc.2007.07.085_bib8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0167-5060(08)70507-7","article-title":"Monochromatic paths in graphs","volume":"3","author":"Rado","year":"1978","journal-title":"Ann. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0700578X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0700578X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T23:21:09Z","timestamp":1546644069000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X0700578X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":8,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["S0012365X0700578X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2007.07.085","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2008,9]]}}}