{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T08:12:21Z","timestamp":1790323941633,"version":"4.1.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3096,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1016\/j.jctb.2004.09.008","type":"journal-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T12:23:03Z","timestamp":1100262183000},"page":"117-125","source":"Crossref","is-referenced-by-count":31,"title":["Path decompositions and Gallai's conjecture"],"prefix":"10.1016","volume":"93","author":[{"given":"Genghua","family":"Fan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2004.09.008_bib1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0012-365X(99)00167-3","article-title":"Gallai's conjecture for disconnected graphs","volume":"213","author":"Dean","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.jctb.2004.09.008_bib2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/jgt.3190040207","article-title":"An upper bound for the path number of a graph","volume":"4","author":"Donald","year":"1980","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.jctb.2004.09.008_bib3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1006\/jctb.2001.2063","article-title":"Subgraph coverings and edge-switchings","volume":"84","author":"Fan","year":"2002","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2004.09.008_bib4","series-title":"Theory of Graphs","first-page":"231","article-title":"On covering of graphs","author":"Lov\u00e1sz","year":"1968"},{"key":"10.1016\/j.jctb.2004.09.008_bib5","first-page":"583","article-title":"Covering the edges of a graph by ...","volume":"60","author":"Pyber","year":"1991","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"10.1016\/j.jctb.2004.09.008_bib6","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1006\/jctb.1996.0012","article-title":"Covering the edges of a connected graph by paths","volume":"66","author":"Pyber","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2004.09.008_bib7","unstructured":"L. Yan, On path decompositions of graphs, Ph.D. Thesis, Arizona State University, 1998."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895604000875?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895604000875?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T22:26:58Z","timestamp":1549060018000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895604000875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["S0095895604000875"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2004.09.008","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}