Author:
Lévêque Benjamin,Lin David Y.,Maffray Frédéric,Trotignon Nicolas
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. On the local restrictions effect on the complexity of finding the graph independence number;Alekseev;Combinatorial-Algebraic Methods in Applied Mathematics,1983
2. N. Alon, R. Yuster, U. Zwick, Finding and counting given length cycles, in: Proceedings of the 2nd European Symposium on Algorithms, Utrecht, The Netherlands, 1994, pp. 354–364
3. On the complexity of testing for odd holes and induced odd paths;Bienstock;Discrete Mathematics,1991
4. Recognizing Berge graphs;Chudnovsky;Combinatorica,2005
5. M. Chudnovsky, P. Seymour, The three-in-a-tree problem, Manuscript
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献