{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:22:53Z","timestamp":1648858973195},"reference-count":19,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":4760,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1995,9]]},"abstract":"<jats:p>A linear forest is the union of a set of vertex disjoint paths. Akiyama, Exoo and Harary, and independently Hilton, have conjectured that the edges of every graph of maximum degree \u0394 can be covered by <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S0963548300001632inline2\" \/> linear forests. We show that almost every graph can be covered with this number of linear forests.<\/jats:p>","DOI":"10.1017\/s0963548300001632","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:15:38Z","timestamp":1221218138000},"page":"257-268","source":"Crossref","is-referenced-by-count":2,"title":["Almost Every Graph can be Covered by  Linear Forests"],"prefix":"10.1017","volume":"4","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300001632_ref013","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1970.tb56470.x"},{"key":"S0963548300001632_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90084-0"},{"key":"S0963548300001632_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF02783300"},{"key":"S0963548300001632_ref014","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579280"},{"key":"S0963548300001632_ref001","first-page":"1","article-title":"A short proof of the linear arboricity for cubic graphs","author":"Akiyama","year":"1981","journal-title":"Bull. Liber. Arts and Sci."},{"key":"S0963548300001632_ref012","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100408"},{"key":"S0963548300001632_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)00465-4"},{"key":"S0963548300001632_ref017","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010405"},{"key":"S0963548300001632_ref010","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080211"},{"key":"S0963548300001632_ref019","first-page":"239","article-title":"Note on linear arboricity","volume":"32","author":"Tomasta","year":"1982","journal-title":"Math. Slovaka"},{"key":"S0963548300001632_ref003","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110108"},{"key":"S0963548300001632_ref007","volume-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"S0963548300001632_ref009","unstructured":"[9] Enomoto H. (1981) The linear arboricity of 5-regular graphs. Technical Report, Department of Information Science, University of Tokyo."},{"key":"S0963548300001632_ref018","unstructured":"[18] Peroche B. (1982) On partition of graphs into linear forests and dissections. Preprint."},{"key":"S0963548300001632_ref016","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107359949.008"},{"key":"S0963548300001632_ref015","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"S0963548300001632_ref006","volume-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"S0963548300001632_ref011","first-page":"225","article-title":"The linear arboricity of 10-regular graphs","volume":"36","author":"Guldan","year":"1986","journal-title":"Math. Slovaka"},{"key":"S0963548300001632_ref002","first-page":"405","article-title":"Covering and packing in graph III. Cyclic and acyclic invariants","volume":"30","author":"Akiyama","year":"1980","journal-title":"Maths Slovaka"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300001632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:04:25Z","timestamp":1557781465000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300001632\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["S0963548300001632"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300001632","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}