Publisher
Springer International Publishing
Reference41 articles.
1. Abu-Khzam, F.N.: Maximum common induced subgraph parameterized by vertex cover. Inf. Process. Lett. 114(3), 99–103 (2014). https://doi.org/10.1016/j.ipl.2013.11.007
2. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991). https://doi.org/10.1016/0196-6774(91)90006-K
3. Asahiro, Y., Miyano, E., Ono, H.: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. 159(7), 498–508 (2011). https://doi.org/10.1016/j.dam.2010.11.003
4. Assmann, S.F., Peck, G.W., Sysło, M.M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM J. Algebraic Discrete Methods 2(4), 387–393 (1981). https://doi.org/10.1137/0602041
5. Barefoot, C.A., Entringer, R.C., Swart, H.C.: Vulnerability in graphs – a comparative survey. J. Combin. Math. Combin. Comput. 1, 13–22 (1987)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献