Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference19 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
2. Riemann-Roch and Abel-Jacobi theory on a finite graph;Baker;Adv. Math.,2007
3. Harmonic morphisms and hyperelliptic graphs;Baker;Int. Math. Res. Not. IMRN,2009
4. Dynamic programming on graphs of bounded treewidth;Bodlaender,1988
5. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Strict Brambles;Graphs and Combinatorics;2023-02-19
2. On the scramble number of graphs;Discrete Applied Mathematics;2022-03
3. A new lower bound on graph gonality;Discrete Applied Mathematics;2022-03
4. On the Gonality of Cartesian Products of Graphs;The Electronic Journal of Combinatorics;2020-12-24