Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. A characterization of rigid circuit graphs;Bunemann;Discrete Math.,1974
2. E. Dahlhaus, Minimal Elimination of Planar Graphs, SWAT’98.
3. E. Dahlhaus, in: R. Reischuk, M. Morvan (Eds.), Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs, STACS 97, LLNCS, Vol. 1200, 1997, pp. 487–498.
4. E. Dahlhaus, Efficient parallel algorithms on chordal graphs with a sparse tree representation, Proceedings of the 27th Annual Hawaii International Conference on System Sciences, Vol. II, 1994, pp. 150–158.
5. Characterizations of strongly chordal graphs;Farber;Discrete Math.,1983
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献