Author:
Bruhn Henning,Saito Akira
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. On the complexity of testing for odd holes and induced odd paths;Bienstock;Discrete Math.,1991
2. The three-in-a-tree problem;Chudnovsky;Combinatorica,2010
3. The structure of claw-free graphs;Chudnovsky,2005
4. Graph Theory;Diestel,2005
5. The k-in-a-path problem for claw-free graphs;Fiala,2010
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献