{"title":"Detecting an Odd Hole","authors":"M. Chudnovsky, A. Scott, P. Seymour, S. Spirkl","doi":"10.1145/3375720","DOIUrl":null,"url":null,"abstract":"We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"42 1","pages":"1 - 12"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3375720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26
Abstract
We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
