{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:09:17Z","timestamp":1753880957430,"version":"3.41.2"},"reference-count":41,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11701059","11971311"],"award-info":[{"award-number":["11701059","11971311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Chongqing Education Commission of China","award":["KJQN202101130"],"award-info":[{"award-number":["KJQN202101130"]}]},{"name":"Chongqing Natural Science Foundation Innovation and Development Joint Fund","award":["CSTB2022NSCQ-LZX0003"],"award-info":[{"award-number":["CSTB2022NSCQ-LZX0003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p> In the research content of this paper, we characterize the unit interval graphs which are paired [Formula: see text]-disjoint path coverable. Specifically, we prove that [Formula: see text] is paired [Formula: see text]-disjoint path coverable if and only if [Formula: see text] is [Formula: see text]-connected, where [Formula: see text]. Moreover, we show that [Formula: see text] is semi-paired [Formula: see text]-disjoint path coverable if and only if [Formula: see text] is [Formula: see text]-connected where [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830923501057","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T03:04:05Z","timestamp":1702350245000},"source":"Crossref","is-referenced-by-count":0,"title":["On the unit interval graphs which are paired k-disjoint path coverable"],"prefix":"10.1142","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3092-9692","authenticated-orcid":false,"given":"Peng","family":"Li","sequence":"first","affiliation":[{"name":"College of Science, Chongqing University of Technology, 400054 Chongqing, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4831-2239","authenticated-orcid":false,"given":"Tong","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Science, Chongqing University of Technology, 400054 Chongqing, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5934-1326","authenticated-orcid":false,"given":"Yangjing","family":"Long","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics and Hubei, Key Laboratory of Mathematical Sciences, Central China, Normal University, 430079 Wuhan, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"S1793830923501057BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90064-5"},{"key":"S1793830923501057BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9292-5"},{"key":"S1793830923501057BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830923501057BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.05.006"},{"key":"S1793830923501057BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.02.028"},{"key":"S1793830923501057BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00307-X"},{"key":"S1793830923501057BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.07.001"},{"key":"S1793830923501057BIB008","doi-asserted-by":"publisher","DOI":"10.1137\/11083856X"},{"key":"S1793830923501057BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90223-G"},{"key":"S1793830923501057BIB010","doi-asserted-by":"publisher","DOI":"10.1137\/060678476"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M. R.","key":"S1793830923501057BIB011"},{"key":"S1793830923501057BIB012","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","volume":"57","author":"Golumbic M. C.","year":"2004","edition":"2"},{"key":"S1793830923501057BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.07.015"},{"key":"S1793830923501057BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.06.001"},{"key":"S1793830923501057BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.10.008"},{"key":"S1793830923501057BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.04.013"},{"key":"S1793830923501057BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.045"},{"key":"S1793830923501057BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.133"},{"key":"S1793830923501057BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.02.014"},{"key":"S1793830923501057BIB020","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2012.656614"},{"key":"S1793830923501057BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(95)00139-P"},{"key":"S1793830923501057BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.03.012"},{"key":"S1793830923501057BIB023","doi-asserted-by":"publisher","DOI":"10.1137\/140981265"},{"key":"S1793830923501057BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(93)90308-I"},{"key":"S1793830923501057BIB025","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-009-0004-y"},{"key":"S1793830923501057BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234213"},{"key":"S1793830923501057BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03512-7"},{"key":"S1793830923501057BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.12.002"},{"key":"S1793830923501057BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.04.012"},{"key":"S1793830923501057BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.02.010"},{"key":"S1793830923501057BIB031","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.12.008"},{"key":"S1793830923501057BIB032","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.37"},{"key":"S1793830923501057BIB033","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.160"},{"key":"S1793830923501057BIB034","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.01.019"},{"key":"S1793830923501057BIB035","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.03.010"},{"key":"S1793830923501057BIB036","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"Roberts F. S.","year":"1969"},{"key":"S1793830923501057BIB037","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90010-4"},{"key":"S1793830923501057BIB038","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.01.005"},{"key":"S1793830923501057BIB039","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.035"},{"key":"S1793830923501057BIB040","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90123-B"},{"key":"S1793830923501057BIB041","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.04.002"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923501057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T04:24:54Z","timestamp":1730435094000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923501057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"references-count":41,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.1142\/S1793830923501057"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923501057","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"article-number":"2350105"}}