Journal article icon

Journal article

Detecting an odd hole

Abstract:
We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/3375720

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Merton College
Role:
Author
ORCID:
0000-0003-4489-5988
Publisher:
Association for Computing Machinery Publisher's website
Journal:
Journal of the ACM Journal website
Volume:
67
Issue:
1
Article number:
5
Publication date:
2020-01-29
Acceptance date:
2019-10-26
DOI:
EISSN:
1557-735X
ISSN:
0004-5411
Source identifiers:
1070393
Language:
English
Keywords:
Pubs id:
pubs:1070393
UUID:
uuid:5331874f-85fd-4043-9c67-6bc3e92f6fa6
Local pid:
pubs:1070393
Deposit date:
2019-11-07

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP