Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. An approach to the subgraph homeomorphism problem;Asano;Theoret. Comput. Sci.,1985
2. The point-arboricity of planar graphs;Chartrand;J. London Math. Soc.,1969
3. The point-arboricity of a graph;Chartrand;Israel J. Math.,1968
4. Z.-Z. Chen, NC algorithms for partitioning sparse graphs into induced forests with an application, in: Proc. 6th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1004, Springer, Berlin, 1995, pp. 428–437.
5. Parallel complexity of partitioning a planar graph into vertex-induced forests;Chen;Discrete Appl. Math.,1996
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献