Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference84 articles.
1. An efficient algorithm for finding a two-pair, and its applications;Arikati;Discrete Appl. Math.,1991
2. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
3. A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring;Balas;Discrete Appl. Math.,1986
4. On the desirability of acyclic database systems;Beeri;J. Assoc. Comput. Mach.,1983
5. A. Berry, Désarticulation d’un graphe, Ph.D. Thesis, LIRMM, Montpellier, France, 1998.
Cited by
117 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure;Journal of Combinatorial Theory, Series B;2024-07
2. Graphs with at most two moplexes;Journal of Graph Theory;2024-05-08
3. Bisimplicial separators;Journal of Graph Theory;2024-04-11
4. Computing and Listing Avoidable Vertices and Paths;Algorithmica;2023-09-04
5. Adjusted Harris Hawks Optimization for the Minimum Weight Triangulation;2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME);2023-07-19