Author:
Bonomo-Braberman Flavia,Nascimento Julliano R.,Oliveira Fabiano S.,Souza Uéverton S.,Szwarcfiter Jayme L.
Publisher
Springer International Publishing
Reference33 articles.
1. Beineke, L.: Derived graphs of digraphs. In: Sachs, H., Voss, H.J., Walter, H.J. (eds.) Beiträge zur Graphentheorie, pp. 17–33. Teubner, Leipzig (1968)
2. Bodlaender, H.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1–2), 1–45 (1998)
3. Bodlaender, H., Drange, P., Dregi, M., Fomin, F., Lokshtanov, D., Pilipczuk, M.: A $$O(c^kn)$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317–378 (2016)
4. Cao, Y., Ke, Y., Otachi, Y., You, J.: Vertex deletion problems on chordal graphs. Theoret. Comput. Sci. 745, 75–86 (2018)
5. Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Webb, B. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 327, pp. 153–171. Cambridge University Press (2005)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献