大连通性或大最小度有向图中具有长度约束的不相交环

{"title":"大连通性或大最小度有向图中具有长度约束的不相交环","authors":"Raphael Steiner","doi":"10.1137/20m1382398","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":21749,"journal":{"name":"SIAM J. Discret. Math.","volume":"329 1","pages":"1343-1362"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree\",\"authors\":\"Raphael Steiner\",\"doi\":\"10.1137/20m1382398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":21749,\"journal\":{\"name\":\"SIAM J. Discret. Math.\",\"volume\":\"329 1\",\"pages\":\"1343-1362\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM J. Discret. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/20m1382398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM J. Discret. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/20m1382398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}