Author:
Chudnovsky Maria,Scott Alex,Seymour Paul
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. E. BERGER, P. SEYMOUR and S. SPIRKL: Finding an induced path that is not a shortest path, submitted for publication, arXiv:2005.12861.
2. D. BIENSTOCK: On the complexity of testing for odd holes and induced odd paths, Discrete Math. 90 (1991), 85–92.
3. D. BIENSTOCK: Corrigendum: On the complexity of testing for odd holes and induced odd paths, Discrete Math. 102 (1992), 109.
4. M. CHUDNOVSKY, G. CORNUÉJOLS, X. LIU, P. SEYMOUR and K. VUŠKOVIĆ: Recognizing Berge graphs, Combinatorica 25 (2005), 143–186.
5. M. CHUDNOVSKY, A. SCOTT and P. SEYMOUR: Finding a shortest odd hole, submitted for publication, arXiv:2004.11874.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Detecting a long even hole;European Journal of Combinatorics;2022-08
2. Finding a shortest even hole in polynomial time;Journal of Graph Theory;2021-09-24
3. Finding a Shortest Odd Hole;ACM Transactions on Algorithms;2021-06