满足偶切条件的最小二连通图

{"title":"满足偶切条件的最小二连通图","authors":"A. Jobson, André E. Kézdy, J. Lehel","doi":"10.1016/j.ipl.2020.106080","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"13 1","pages":"106080"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimal 2-connected graphs satisfying the even cut condition\",\"authors\":\"A. Jobson, André E. Kézdy, J. Lehel\",\"doi\":\"10.1016/j.ipl.2020.106080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":13545,\"journal\":{\"name\":\"Inf. Process. Lett.\",\"volume\":\"13 1\",\"pages\":\"106080\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Inf. Process. Lett.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/j.ipl.2020.106080\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inf. Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.ipl.2020.106080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}