Detecting an Odd Hole

Author:

Chudnovsky Maria1,Scott Alex2,Seymour Paul1,Spirkl Sophie3ORCID

Affiliation:

1. Princeton University, Princeton NJ, USA

2. Mathematical Institute, University of Oxford, Oxford, UK

3. Rutgers University

Abstract

We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.

Funder

Leverhulme Trust Research Fellowship

National Science Foundation

Air Force Office of Scientific Research

U. S. Army Research Office

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference16 articles.

1. Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind;Berge Claude;Wiss. Z.,1961

2. On the complexity of testing for odd holes and induced odd paths

3. Corrigendum

4. Recognizing Berge Graphs

5. Detecting a Theta or a Prism

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Shortest odd paths in undirected graphs with conservative weight functions;Discrete Applied Mathematics;2024-11

2. First-order logic with metric betweenness – the case of non-definability of some graph classes;AKCE International Journal of Graphs and Combinatorics;2023-12-14

3. Detecting a long even hole;European Journal of Combinatorics;2022-08

4. Finding a shortest even hole in polynomial time;Journal of Graph Theory;2021-09-24

5. Polyhedral properties of the induced cluster subgraphs;Discrete Applied Mathematics;2021-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3