Author:
Cameron Kathie,Eschen Elaine M.,Hoàng Chính T.,Sritharan R.
Reference20 articles.
1. S.R. Arikati, C. Pandu Rangan, and G.K. Manacher, Efficient reduction for path problems on circular-arc graphs, BIT
31 (1991), 182–193.
2. S.R. Arikati and U.N. Peled, A linear algorithm for group path problem on chordal graphs, Discrete Appl. Math.
44 (1993), 185–190.
3. D. Bienstock, On the complexity of testing for odd holes and induced odd paths, Discrete Math. 90 (1991), 85–92. See also corrigendum by B. Reed, Discrete Math. 102 (1992), p. 109.
4. C. Berge, Perfect graphs, 1–21, Six Papers on Graph Theory, Indian Statistical Institute, 1963.
5. DIMACS Ser. Discrete Math. Theoret. Comput. Sci.;K. Cameron,1990
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献