{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:15:51Z","timestamp":1770747351917,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0095-8956(03)00031-5","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:27:43Z","timestamp":1049506063000},"page":"281-297","source":"Crossref","is-referenced-by-count":37,"title":["Bounded size components\u2014partitions and transversals"],"prefix":"10.1016","volume":"88","author":[{"given":"Penny","family":"Haxell","sequence":"first","affiliation":[]},{"given":"Tibor","family":"Szab\u00f3","sequence":"additional","affiliation":[]},{"given":"G\u00e1bor","family":"Tardos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00031-5_BIB1","article-title":"A short proof of the linear arboricity for cubic graphs","volume":"2","author":"Akiyama","year":"1981","journal-title":"Bull. Liber. Arts Sci. NMS"},{"key":"10.1016\/S0095-8956(03)00031-5_BIB2","first-page":"405","article-title":"Coverings and packings in graphs II. Cyclic and acyclic invariants","volume":"30","author":"Akiyama","year":"1980","journal-title":"Math. Slovaca"},{"key":"10.1016\/S0095-8956(03)00031-5_BIB3","first-page":"97","article-title":"More on the linear k-arboricity of regular graphs","volume":"18","author":"Aldred","year":"1998","journal-title":"Australas. J. Combin."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0095-8956(02)00006-0","article-title":"Partitioning into graphs with only small components","volume":"87","author":"Alon","year":"2003","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00031-5_BIB5","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0095-8956(03)00031-5_BIB6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(84)90075-X","article-title":"On linear k-arboricity","volume":"52","author":"Bermond","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(75)90011-4","article-title":"On complete subgraphs of r-chromatic graphs","volume":"13","author":"Bollob\u00e1s","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB8","unstructured":"G. Ding, B. Oporowski, D. Sanders, D. Vertigan, preprint."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB9","unstructured":"P. Erd\u0151s, L. Lov\u00e1sz, Problems and results on 3-chromatic hypergraphs and some related questions, in: A. Hajnal, R. Rado, V.T. S\u00f3s (Eds.), Infinite and Finite Sets, North-Holland, Amsterdam, pp. 609\u2013628; Colloq. Math. Soc. J\u00e1nos Bolyai, 10 (1975)."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1017\/S0963548301004758","article-title":"A note on vertex list colouring","volume":"10","author":"Haxell","year":"2001","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(95)00293-6","article-title":"On the linear k-arboricity of cubic graphs","volume":"162","author":"Jackson","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB12","first-page":"237","article-title":"On decomposition of graphs","volume":"1","author":"Lov\u00e1sz","year":"1966","journal-title":"Stud. Sci. Math. Hung."},{"key":"10.1016\/S0095-8956(03)00031-5_BIB13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jctb.1998.1868","article-title":"Two-colouring the edges of a cubic graph such that each monochromatic component is a path of length at most 5","volume":"75","author":"Thomassen","year":"1999","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00031-5_BIB14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(96)00300-7","article-title":"Independent transversals in r-partite graphs","volume":"176","author":"Yuster","year":"1997","journal-title":"Discrete Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000315?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000315?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:52:18Z","timestamp":1553406738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0095895603000315"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00031-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}