Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time

被引：0

作者：

Agrawal, Akanksha ^{[1
]}

Lima, Paloma T. ^{[2
]}

Lokshtanov, Daniel ^{[3
]}

Saurabh, Saket ^{[4
,5
]}

Sharma, Roohani ^{[6
]}

机构：

[1] Indian Institute of Technology Madras, Chennai, India

[2] IT University of Copenhagen, Copenhagen, Denmark

[3] University of Califormia, Santa Barbara, United States

[4] Institute of Mathematical Sciences, Chennai, India

[5] University of Bergen, Norway

[6] Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany

来源：

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2024年 / 2024-January卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：5276 / 5290

共 3 条

[1] Critical (P5, dart) -Free Graphs
Xia, Wen
Jooken, Jorik
Goedgebeur, Jan
Huang, Shenwei
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 14462 LNCS : 390 - 402
[2] Vertex-Critical (P5, chair)-Free Graphs
Huang, Shenwei
Li, Zeyu
arXiv, 2023,
[3] Coloring (P5,gem-free graphs with Δ−1 colors
Cranston, Daniel W.
Lafayette, Hudson
Rabern, Landon
Journal of Graph Theory, 2022, 101 (04): : 633 - 642