Author:
Thompson João Vinicius C.,Nogueira Loana T.,Protti Fábio,Bravo Raquel S. F.,Dourado Mitre C.,Souza Uéverton S.
Publisher
Springer International Publishing
Reference48 articles.
1. Araujo, R.T., Sampaio, R.M., Szwarcfiter, J.L.: The convexity of induced paths of order three. Discrete Math. 44, 109–114 (2013)
2. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)
3. Atici, M.: Computational complexity of geodetic set. Int. J. Comput. Math. 79, 587–591 (2002)
4. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1–2), 1–45 (1998)
5. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey, vol. 3. SIAM, Philadelphia (1999)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A general framework for path convexities;Journal of Combinatorial Optimization;2020-06-29