{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:07:46Z","timestamp":1780351666678,"version":"3.54.1"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071265"],"award-info":[{"award-number":["12071265"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR202102250232"],"award-info":[{"award-number":["ZR202102250232"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> A graph [Formula: see text] has a [Formula: see text]-partition if [Formula: see text] can be partitioned into two nonempty disjoint subsets [Formula: see text] and [Formula: see text] so that [Formula: see text] and [Formula: see text] are graphs whose components are paths of order at most [Formula: see text] and [Formula: see text], respectively. In this paper, we proved that every planar graph with girth at least six giving that [Formula: see text]-cycle is not intersecting with [Formula: see text]-cycle admits a [Formula: see text]-partition, where [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830922501580","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T12:10:01Z","timestamp":1663330201000},"source":"Crossref","is-referenced-by-count":1,"title":["Path partition of planar graphs with girth at least six"],"prefix":"10.1142","volume":"15","author":[{"given":"Xiaoling","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5050-7630","authenticated-orcid":false,"given":"Lei","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"issue":"2","key":"S1793830922501580BIB001","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0095-8956(02)00006-0","volume":"87","author":"Alon N.","year":"2003","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"S1793830922501580BIB002","first-page":"429","volume":"21","author":"Appel K.","year":"1977","journal-title":"Illinois J. Math."},{"issue":"3","key":"S1793830922501580BIB003","first-page":"491","volume":"21","author":"Appel K.","year":"1977","journal-title":"Illinois J. Math."},{"issue":"3","key":"S1793830922501580BIB004","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1002\/jgt.22093","volume":"85","author":"Axenovich M.","year":"2017","journal-title":"J. Graph Theory"},{"issue":"2","key":"S1793830922501580BIB005","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/jgt.20516","volume":"67","author":"Borodin O. V.","year":"2011","journal-title":"J.\u00a0Graph Theory"},{"issue":"22","key":"S1793830922501580BIB006","doi-asserted-by":"crossref","first-page":"2638","DOI":"10.1016\/j.disc.2013.07.014","volume":"313","author":"Borodin O. V.","year":"2013","journal-title":"Discrete Math."},{"issue":"8","key":"S1793830922501580BIB007","doi-asserted-by":"crossref","first-page":"111921","DOI":"10.1016\/j.disc.2020.111921","volume":"343","author":"Choi I.","year":"2020","journal-title":"Discrete Math."},{"issue":"1","key":"S1793830922501580BIB009","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(91)90166-Y","volume":"91","author":"Goddard W.","year":"1991","journal-title":"Discrete Math."},{"issue":"1","key":"S1793830922501580BIB010","doi-asserted-by":"crossref","DOI":"10.37236\/3509","volume":"22","author":"Montassier M.","year":"2015","journal-title":"Electron. J. Combin."},{"issue":"1","key":"S1793830922501580BIB011","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/jgt.3190140108","volume":"14","author":"Poh K. S.","year":"1990","journal-title":"J. Graph Theory"},{"key":"S1793830922501580BIB012","first-page":"125032","volume":"374","author":"Wang Y.","year":"2020","journal-title":"Appl. Math. Comput."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:08:11Z","timestamp":1689930491000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":11,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S1793830922501580"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501580","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,17]]},"article-number":"2250158"}}