{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T12:15:03Z","timestamp":1782562503365,"version":"3.54.5"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5768,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0166-218x(97)00012-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"227-233","source":"Crossref","is-referenced-by-count":33,"title":["k-Path partitions in trees"],"prefix":"10.1016","volume":"78","author":[{"given":"Jing-Ho","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandra M.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"stephen T.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00012-7_BIB1","article-title":"Graph clustering: complexity, sequential and parallel algorithms","author":"Abbas","year":"1994"},{"key":"10.1016\/S0166-218X(97)00012-7_BIB2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(90)90064-5","article-title":"Linear algorithm for optimal path cover problem on interval graphs","volume":"35","author":"Arikati","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(97)00012-7_BIB3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(79)90011-5","article-title":"Minimum node disjoint path covering for circular-arc graphs","volume":"8","author":"Bonuccelli","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(97)00012-7_BIB4","unstructured":"G.J. Chang and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., to appear."},{"key":"10.1016\/S0166-218X(97)00012-7_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(97)00012-7_BIB6","first-page":"262","article-title":"On the Hamiltonian completion problem","author":"Goodman","year":"1974"},{"key":"10.1016\/S0166-218X(97)00012-7_BIB7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00012-7_BIB8","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1137\/0221061","article-title":"An O (n2 log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs","volume":"21","author":"Hsu","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00012-7_BIB9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0020-0190(75)90057-5","article-title":"Optimal chain partitions of trees","volume":"4","author":"Misra","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(97)00012-7_BIB10","series-title":"Proc. 2nd Czechoslovakian Symp. on Graph Theory","article-title":"Path partitions of vertices and hamiltonicity of graphs","author":"Skupien","year":"1974"},{"key":"10.1016\/S0166-218X(97)00012-7_BIB11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0304-3975(93)90123-B","article-title":"Optimal path cover problem on block graphs and bipartite permutation graphs","volume":"115","author":"Srikant","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00012-7_BIB12","article-title":"The path partition and related problems","author":"Yan","year":"1994"},{"key":"10.1016\/S0166-218X(97)00012-7_BIB13","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(94)00158-8","article-title":"The path partition problem","volume":"52","author":"Yan","year":"1994","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000127?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000127?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:25Z","timestamp":1556130565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0166218X97000127"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00012-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}