{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T20:09:06Z","timestamp":1778357346483,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115910","type":"journal-article","created":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T13:09:10Z","timestamp":1775135350000},"page":"115910","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Covering and partitioning of split, chain and cographs with isometric paths"],"prefix":"10.1016","volume":"1075","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0534-6417","authenticated-orcid":false,"given":"Dibyayan","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1123-1774","authenticated-orcid":false,"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1935-651X","authenticated-orcid":false,"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6213-8687","authenticated-orcid":false,"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8318-2588","authenticated-orcid":false,"given":"Mateusz","family":"Rychlicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115910_bib0001","series-title":"Leibniz International Proceedings in Informatics","article-title":"Covering and partitioning of split, chain and cographs with isometric paths","author":"Chakraborty","year":"2024"},{"issue":"1","key":"10.1016\/j.tcs.2026.115910_bib0002","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(02)00425-0","article-title":"Splitting a graph into disjoint induced paths or cycles","volume":"131","author":"Le","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115910_bib0003","first-page":"23413","article-title":"Active learning of convex halfspaces on graphs","volume":"34","author":"Thiessen","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.tcs.2026.115910_bib0004","series-title":"Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing","first-page":"79","article-title":"Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs","author":"Abraham","year":"2014"},{"issue":"3","key":"10.1016\/j.tcs.2026.115910_bib0005","first-page":"792","article-title":"LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs","volume":"42","author":"Corneil","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2026.115910_bib0006","series-title":"Graphs and Combinatorics","first-page":"262","article-title":"On the Hamiltonian completion problem","author":"Goodman","year":"1974"},{"key":"10.1016\/j.tcs.2026.115910_bib0007","series-title":"North-Holland Mathematics Studies","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-0208(08)73373-5","article-title":"Path partitions in directed graphs","volume":"75","author":"Berge","year":"1983"},{"issue":"2","key":"10.1016\/j.tcs.2026.115910_bib0008","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(88)90063-5","article-title":"Variations on the Gallai-Milgram theorem","volume":"71","author":"Hartman","year":"1988","journal-title":"Discrete Math."},{"issue":"13","key":"10.1016\/j.tcs.2026.115910_bib0009","doi-asserted-by":"crossref","first-page":"2062","DOI":"10.1016\/j.dam.2013.02.020","article-title":"Path covering number and L(2,1)-labeling number of graphs","volume":"161","author":"Lu","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115910_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.115029","article-title":"Parameterizing path partitions","volume":"1028","author":"Fernau","year":"2025","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"10.1016\/j.tcs.2026.115910_bib0011","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.tcs.2006.10.020","article-title":"Induced-path partition on graphs with special blocks","volume":"370","author":"Pan","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115910_bib0012","series-title":"ISAAC 2022","first-page":"12:1","article-title":"Complexity and algorithms for ISOMETRIC PATH COVER on chordal graphs and beyond","volume":"248","author":"Chakraborty","year":"2022"},{"issue":"2","key":"10.1016\/j.tcs.2026.115910_bib0013","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114743","article-title":"Isometric path complexity of graphs","volume":"349","author":"Chakraborty","year":"2026","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115910_bib0014","series-title":"Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings","first-page":"187","article-title":"Parameterizing path partitions","volume":"13898","author":"Fernau","year":"2023"},{"issue":"2","key":"10.1016\/j.tcs.2026.115910_bib0015","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/jgt.22062","article-title":"Partitioning perfect graphs into stars","volume":"85","author":"Van Bevern","year":"2017","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2026.115910_bib0016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2013.10.030","article-title":"XSAT and NAE-SAT of linear CNF classes","volume":"167","author":"Porschen","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115910_bib0017","series-title":"Threshold Graphs and Related Topics","author":"Mahadev","year":"1995"},{"issue":"3","key":"10.1016\/j.tcs.2026.115910_bib0018","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.tcs.2026.115910_bib0019","first-page":"231","article-title":"A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs","volume":"50","author":"Asdre","year":"2007","journal-title":"Netw. Int. J."},{"issue":"2","key":"10.1016\/j.tcs.2026.115910_bib0020","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","article-title":"The pathwidth and treewidth of cographs","volume":"6","author":"Bodlaender","year":"1993","journal-title":"SIAM J. Discrete Math."},{"issue":"23","key":"10.1016\/j.tcs.2026.115910_bib0021","doi-asserted-by":"crossref","first-page":"2763","DOI":"10.1016\/j.disc.2013.08.017","article-title":"The cluster deletion problem for cographs","volume":"313","author":"Gao","year":"2013","journal-title":"Discrete Math."},{"issue":"8","key":"10.1016\/j.tcs.2026.115910_bib0022","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0898-1221(95)00139-P","article-title":"An optimal path cover algorithm for cographs","volume":"30","author":"Lin","year":"1995","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.tcs.2026.115910_bib0023","series-title":"Graph Theory and Computing","first-page":"39","article-title":"Evolution of the path number of a graph: covering and packing in graphs, II","author":"Harary","year":"1972"},{"key":"10.1016\/j.tcs.2026.115910_bib0024","series-title":"Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University June 18\u201322, 1973","first-page":"201","article-title":"On covering the points of a graph with point disjoint paths","author":"Boesch","year":"2006"},{"key":"10.1016\/j.tcs.2026.115910_bib0025","series-title":"Algorithms and Discrete Applied Mathematics","first-page":"147","article-title":"Polynomial-time algorithms for path cover on trees and graphs of bounded treewidth","author":"Foucaud","year":"2025"},{"issue":"2","key":"10.1016\/j.tcs.2026.115910_bib0026","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ipl.2004.09.021","article-title":"Isometric-path numbers of block graphs","volume":"93","author":"Pan","year":"2005","journal-title":"Inf. Process. Lett."},{"issue":"1-3","key":"10.1016\/j.tcs.2026.115910_bib0027","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","article-title":"Hamiltonian circuits in chordal bipartite graphs","volume":"156","author":"M\u00fcller","year":"1996","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.tcs.2026.115910_bib0028","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.7151\/dmgt.2236","article-title":"On the isometric path partition problem","volume":"41","author":"Manuel","year":"2021","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.tcs.2026.115910_bib0029","doi-asserted-by":"crossref","unstructured":"I. Penev, R.B. Sandeep, D.K. Supraja, S. Taruni, Isometric path partition: a new upper bound and a characterization of some extremal graphs, arXiv preprint arXiv: 2505.19913(2025).","DOI":"10.2139\/ssrn.5316212"},{"key":"10.1016\/j.tcs.2026.115910_bib0030","unstructured":"J. Baste, L. De Meyer, U. Giocanti, E. Objois, T. Picavet, A polynomial bound on the pathwidth of graphs edge-coverable by k shortest paths, arXiv preprint arXiv: 2510.02901(2025)."},{"issue":"2","key":"10.1016\/j.tcs.2026.115910_bib0031","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1137\/23M1564511","article-title":"On graphs coverable by shortest paths","volume":"38","author":"Dumas","year":"2024","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2026.115910_bib0032","unstructured":"P. Bastide, J. Duron, J. Hodor, W. Liu, X. Nie, Counterexamples to statements on isometric graph coverings, arXiv preprint arXiv: 2511.03524(2025)."},{"key":"10.1016\/j.tcs.2026.115910_bib0033","unstructured":"D. Chakraborty, O. Defrain, F. Foucaud, M. Mari, P. Tale, Parameterized complexity of isometric path partition: treewidth and diameter, arXiv preprint arXiv: 2508.05448(2025)."},{"key":"10.1016\/j.tcs.2026.115910_bib0034","doi-asserted-by":"crossref","unstructured":"F. Foucaud, A. Majumder, T. M\u00f6mke, A. Roshany-Tabrizi, Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth, arXiv preprint arXiv: 2511.07160(2025).","DOI":"10.1007\/978-3-031-83438-7_13"},{"issue":"3","key":"10.1016\/j.tcs.2026.115910_bib0035","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001696?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001696?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T19:30:33Z","timestamp":1778355033000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":35,"alternative-id":["S0304397526001696"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115910","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Covering and partitioning of split, chain and cographs with isometric paths","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115910","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Crown Copyright \u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115910"}}