{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T23:37:07Z","timestamp":1772149027615,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8843,"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":[[1989,5]]},"DOI":"10.1016\/0012-365x(89)90073-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"11-22","source":"Crossref","is-referenced-by-count":57,"title":["The star arboricity of graphs"],"prefix":"10.1016","volume":"75","author":[{"given":"I.","family":"Algor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Alon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90073-3_BIB1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02783300","article-title":"The linear arboricity of graphs","volume":"62","author":"Alon","year":"1988","journal-title":"Israel J. Math."},{"key":"10.1016\/0012-365X(89)90073-3_BIB2","first-page":"405","article-title":"Covering and packing in graphs III, cyclic and acyclic invariants","volume":"30","author":"Akiyama","year":"1980","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(89)90073-3_BIB3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230110108","article-title":"Covering and packing in graphs IV, Linear arboricity","volume":"11","author":"Akiyama","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0012-365X(89)90073-3_BIB4","series-title":"Graph Theory and its Applications","article-title":"Path factors of a graph","author":"Akiyama","year":"1984"},{"key":"10.1016\/0012-365X(89)90073-3_BIB5","unstructured":"Y. Aoki, The star arboricity of the complete regular multipartite graphs, preprint."},{"key":"10.1016\/0012-365X(89)90073-3_BIB6","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0012-365X(89)90073-3_BIB7","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/0012-365X(89)90073-3_BIB8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0195-6698(81)80015-7","article-title":"Graphs which contain all small graphs","volume":"2","author":"Bollob\u00e1s","year":"1981","journal-title":"Europ. J. Combinatorics"},{"key":"10.1016\/0012-365X(89)90073-3_BIB9","series-title":"Technical report","article-title":"The linear arboricity of 5-regular graphs","author":"Enomoto","year":"1981"},{"key":"10.1016\/0012-365X(89)90073-3_BIB10","series-title":"Infinite and Finite Sets","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","author":"Erd\u00f6s","year":"1975"},{"key":"10.1016\/0012-365X(89)90073-3_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190080211","article-title":"The linear arboricity of some regular graphs","volume":"8","author":"Enomoto","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(89)90073-3_BIB12","first-page":"225","article-title":"The linear arboricity of 10-regular graphs","volume":"36","author":"Guldan","year":"1986","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(89)90073-3_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","article-title":"A constructive solution to a tournament problem","volume":"14","author":"Graham","year":"1971","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(89)90073-3_BIB14","first-page":"79","article-title":"Ramsey Theory","author":"Graham","year":"1980"},{"key":"10.1016\/0012-365X(89)90073-3_BIB15","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decomposition of finite graphs into forests","volume":"39","author":"Nash-Williams","year":"1964","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(89)90073-3_BIB16","unstructured":"B. Peroche, On partition of graphs into linear forests and dissections, preprint."},{"key":"10.1016\/0012-365X(89)90073-3_BIB17","first-page":"239","article-title":"Note on linear arboricity","volume":"32","author":"Tomasta","year":"1982","journal-title":"Math. Slovaca"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900733?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900733?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:50:55Z","timestamp":1555120255000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89900733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0012365X89900733"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90073-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}