{"title":"周长至少为6的平面图的路径划分","authors":"Xiaoling Liu, Lei Sun, Wei Zheng","doi":"10.1142/s1793830922501580","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"48 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Path partition of planar graphs with girth at least 6\",\"authors\":\"Xiaoling Liu, Lei Sun, Wei Zheng\",\"doi\":\"10.1142/s1793830922501580\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":45568,\"journal\":{\"name\":\"Discrete Mathematics Algorithms and Applications\",\"volume\":\"48 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793830922501580\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830922501580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}