{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:27Z","timestamp":1725662847055},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540107040"},{"type":"electronic","value":"9783540386612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10704-5_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:14:35Z","timestamp":1330190075000},"page":"38-44","source":"Crossref","is-referenced-by-count":3,"title":["A status on the linear arboricity"],"prefix":"10.1007","author":[{"given":"J.","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"4_CR1","unstructured":"J.Akiyama and V.Chv\u00e1tal, Another proof of the linear arboricity for cubic graphs, to appear."},{"key":"4_CR2","unstructured":"J.Akiyama, G.Exoo and F.Harary, Covering and packing in graphs III: Cyclic and acyclic invariants. Math. Slovaca 29(1980)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"J.Akiyama, G.Exoo and F.Harary, Covering and packing in graphs IV: Linear arboricity. Networks 11(1981)","DOI":"10.1002\/net.3230110108"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(79)90024-4","volume":"26","author":"J. Akiyama","year":"1979","unstructured":"J. Akiyama and T. Hamada, The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests. Discrete Math. 26(1979)203\u2013208.","journal-title":"Discrete Math."},{"key":"4_CR5","unstructured":"J.Akiyama and I.Sato, A comment on the linear arboricity for regular multigraphs, to appear."},{"key":"4_CR6","volume-title":"Graphs and Digraphs","author":"M. Behzad","year":"1979","unstructured":"M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber & Schmidt, Boston (1979)"},{"key":"4_CR7","unstructured":"H.Enomoto, The linear arboricity of cubic graphs and 4-regular graphs, Private communication."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1111\/j.1749-6632.1970.tb56470.x","volume":"175","author":"F. Harary","year":"1970","unstructured":"F. Harary, Covering and packing I, Ann. N.Y.Acad. Sci. 175(1970)198\u2013205.","journal-title":"Ann. N.Y.Acad. Sci."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"F.Harary, Graph Theory, Addison-Wesley, Mass. (1969)","DOI":"10.21236\/AD0705364"},{"key":"4_CR10","first-page":"67","volume":"13","author":"F. Harary","year":"1970","unstructured":"F. Harary and D. Hsiao, A formal system for information retrieval files, Comm.A.C.M., 13(1970)67\u201373.","journal-title":"Comm.A.C.M."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C. Nash-Williams","year":"1964","unstructured":"C. Nash-Williams, Decomposition of finite graphs into forests. J. London Math Soc. 39(1964)12.","journal-title":"J. London Math Soc."},{"key":"4_CR12","unstructured":"B.Peroche, On partition of graphs into linear forests and dissections, Rapport de recherche, Centre National de la recherche scientifique"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"J. Petersen, Die Theorie der regularen Graphen, Acta Math. 15(1891)193\u2013200.","journal-title":"Acta Math."},{"key":"4_CR14","first-page":"112","volume-title":"Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing","author":"R. Stanton","year":"1970","unstructured":"R. Stanton, D. Cowan and L. James, Some results on path numbers, Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, Baton, Rouge (1970)112\u2013135."},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0167-5060(08)70514-4","volume-title":"Advances in Graph Theory","author":"W. Tutte","year":"1978","unstructured":"W. Tutte, The subgraph problem, Advances in Graph Theory (B. Bollb\u00e1s, ed.) North-Holland, Amsterdam (1978)289\u2013295."},{"key":"4_CR16","first-page":"25","volume":"3","author":"V. Vizing","year":"1964","unstructured":"V. Vizing, On an estimate of the chromatic class of p-graph, Diskret. Analiz. 3(1964)25\u201330.","journal-title":"Diskret. Analiz."}],"container-title":["Lecture Notes in Computer Science","Graph Theory and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10704-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:38:49Z","timestamp":1619555929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10704-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540107040","9783540386612"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-10704-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}