{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:58:16Z","timestamp":1649041096574},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p>A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with lengths at most k. The linear k-arboricity of G, denote by la<jats:sub>k<\/jats:sub>(G), is the minimum number of linear k-forests needed to partition the edge set E(G) of G. In the case where the lengths of paths are not restricted, we then have the linear arboricity of G which is denoted by la(G). In this paper, we obtain some results about the linear 6-arboricity of the complete bipartite graph K<jats:sub>m,n<\/jats:sub>.<\/jats:p>","DOI":"10.1142\/s1793830913500298","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T02:10:16Z","timestamp":1378174216000},"page":"1350029","source":"Crossref","is-referenced-by-count":0,"title":["THE LINEAR 6-ARBORICITY OF THE COMPLETE BIPARTITE GRAPH K<sub>m,n<\/sub>"],"prefix":"10.1142","volume":"05","author":[{"given":"SHENGJIE","family":"HE","sequence":"first","affiliation":[{"name":"College of Mathematical Science, Tianjin Normal University, Tianjin, 300387, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LIANCUI","family":"ZUO","sequence":"additional","affiliation":[{"name":"College of Mathematical Science, Tianjin Normal University, Tianjin, 300387, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,12,3]]},"reference":[{"key":"rf3","first-page":"97","volume":"18","author":"Aldred R. E. L.","journal-title":"Austral. J. Combin."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080211"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<129::AID-JGT5>3.0.CO;2-A"},{"key":"rf6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00373-002-0504-x","volume":"19","author":"Lih K. W.","journal-title":"Graphs Combin."},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90209-6"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1970.tb56470.x"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00293-6"},{"key":"rf10","first-page":"33","volume":"60","author":"Yen C. H.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.067"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00365-X"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.04.013"},{"key":"rf14","first-page":"65","volume":"79","author":"Zuo L. C.","journal-title":"Ars Combinatoria"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830913500298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T01:52:36Z","timestamp":1596419556000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830913500298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2013,12,3]]},"published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1142\/S1793830913500298"],"URL":"https:\/\/doi.org\/10.1142\/s1793830913500298","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}