Author:
Belmonte Rémy,van ’t Hof Pim,Kamiński Marcin,Paulusma Daniël,Thilikos Dimitrios M.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lecture Notes in Computer Science;F.N. Abu-Khzam,2003
2. Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods 7(2), 305–314 (1986)
3. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(1-2), 1–45 (1998)
4. Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. Journal of Algorithms 32(2), 167–194 (1999)
5. DeVos, M., Dvořák, Z., Fox, J., McDonald, J., Mohar, B., Scheide, D.: Minimum degree condition forcing complete graph immersion. CoRR, arXiv:1101.2630 (January 2011)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献