{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T03:41:35Z","timestamp":1772595695542,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,10,2]],"date-time":"2012-10-02T00:00:00Z","timestamp":1349136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1237-0","type":"journal-article","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T10:05:13Z","timestamp":1349085913000},"page":"1721-1731","source":"Crossref","is-referenced-by-count":7,"title":["On Spanning Disjoint Paths in Line Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Ye","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Hong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erling","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,2]]},"reference":[{"key":"1237_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"1237_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(92)90355-J","volume":"102","author":"L. Cai","year":"1992","unstructured":"Cai L., Corneil D.: On cycle double covers of line graphs. Discrete Math. 102, 103\u2013106 (1992)","journal-title":"Discrete Math."},{"key":"1237_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","volume":"12","author":"P.A. Catlin","year":"1988","unstructured":"Catlin P.A.: A reduction method to find spanning eulerian subgraphs. J. Graph Theory 12, 29\u201345 (1988)","journal-title":"J. Graph Theory"},{"key":"1237_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(95)00149-Q","volume":"160","author":"P.A. Catlin","year":"1996","unstructured":"Catlin P.A., Han Z., Lai H.-J.: Graphs without spanning eulerian subgraphs. Discrete Math. 160, 81\u201391 (1996)","journal-title":"Discrete Math."},{"key":"1237_CR5","unstructured":"Catlin, P.A., Lai, H.-J.: Spanning trails joining two given edges. In: Alavi, Y., Chartrand, G., Oellermann, O., Schwenk, A. (eds.) Graph Theory, Combinatorics, and Applications, vol. 1, pp. 207\u2013222, Kalamazoo (1991)"},{"key":"1237_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0012-365X(00)00076-5","volume":"230","author":"Z.-H. Chen","year":"2001","unstructured":"Chen Z.-H., Lai H.-J., Lai H.Y.: Nowhere zero flows in line graph. Discrete Math. 230, 133\u2013141 (2001)","journal-title":"Discrete Math."},{"key":"1237_CR7","unstructured":"Chen, Y., Lai, H.-J., Li, H., Li, P.: Supereulerian graphs with width s and s-collapsible graphs (2012, submitted)"},{"key":"1237_CR8","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s00373-002-0492-x","volume":"19","author":"R. Gould","year":"2003","unstructured":"Gould R.: Advances on the Hamiltonian problem\u2014a survey. Graphs Combin. 19, 7\u201352 (2003)","journal-title":"Graphs Combin."},{"key":"1237_CR9","unstructured":"Gu, X., Lai, H.-J., Yao, S.: Characterizations of minimal graphs with equal edge connectivity and spanning tree packing number (submitted)"},{"key":"1237_CR10","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F. Harary","year":"1965","unstructured":"Harary F., Nash-Williams C.St.J.A.: On eulerian and hamiltonian graphs and line graphs. Can. Math. Bull. 8, 701\u2013709 (1965)","journal-title":"Can. Math. Bull."},{"key":"1237_CR11","doi-asserted-by":"crossref","unstructured":"Hsu, L.-H., Lin, C.-K.: Graph Theory and Interconnection Networks. CRC Press, Boca Raton (2009).","DOI":"10.1201\/9781420044829"},{"issue":"9","key":"1237_CR12","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1016\/j.aml.2011.04.013","volume":"24","author":"P. Huang","year":"2011","unstructured":"Huang P., Hsu L.: The spanning connectivity of the line graphs. Appl. Math. Lett. 24(9), 1614\u20131617 (2011)","journal-title":"Appl. Math. Lett."},{"key":"1237_CR13","unstructured":"Jaeger, F.: Nowhere-zero flow problems. In: Beineke, L.W., Wilson, R.J. (eds.) Topics in Graph Theory, vol. 3, pp. 70\u201395. Academic Press, London (1988)"},{"key":"1237_CR14","doi-asserted-by":"crossref","first-page":"244","DOI":"10.4236\/am.2010.13030","volume":"1","author":"H.-J. Lai","year":"2010","unstructured":"Lai H.-J., Li P., Liang Y., Xu J.: Reinforcing a matroid to have k disjoint bases. Appl. Math. 1, 244\u2013249 (2010)","journal-title":"Appl. Math."},{"key":"1237_CR15","unstructured":"Li, P.: Bases and cycles in matroids and graphs. Ph. D. Dissertation, West Virginia University (2012)"},{"key":"1237_CR16","first-page":"113","volume":"93","author":"D. Liu","year":"2009","unstructured":"Liu D., Lai H.-J., Chen Z.-H.: Reinforcing the number of disjoint spanning trees. Ars Comb. 93, 113\u2013127 (2009)","journal-title":"Ars Comb."},{"key":"1237_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.St.J.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams C.St.J.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"1237_CR18","unstructured":"Seymour, P.D.: Sums and circuits. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph Theory and Related Topics, pp. 342\u2013355. Academic Press, New York (1979)"},{"key":"1237_CR19","unstructured":"Shao, Y.: Claw-free graphs and line graphs. Ph. D. Dissertation, West Virginia University (2005)"},{"key":"1237_CR20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1017\/S0004972700042660","volume":"8","author":"G. Szekeres","year":"1973","unstructured":"Szekeres G.: Polyhedral decompositions of cubic graphs. Bull. Aust. Math. Soc. 8, 367\u2013387 (1973)","journal-title":"Bull. Aust. Math. Soc."},{"key":"1237_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190100308","volume":"10","author":"C. Thomassen","year":"1986","unstructured":"Thomassen C.: Reflections on graph theory. J. Graph Theory 10, 309\u2013324 (1986)","journal-title":"J. Graph Theory"},{"issue":"51","key":"1237_CR22","first-page":"464","volume":"2","author":"W.T. Tutte","year":"1949","unstructured":"Tutte W.T.: On the imbedding of linear graphs into surfaces. Proc. Lond. Math. Soc. Ser. 2(51), 464\u2013483 (1949)","journal-title":"Proc. Lond. Math. Soc. Ser."},{"key":"1237_CR23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"1237_CR24","first-page":"89","volume":"22","author":"S.M. Zhan","year":"1986","unstructured":"Zhan S.M.: Hamiltonian connectedness of line graphs. Ars Comb. 22, 89\u201395 (1986)","journal-title":"Ars Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1237-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1237-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1237-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T09:49:38Z","timestamp":1562233778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1237-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,2]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1237"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1237-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,2]]}}}