Publisher
Springer Nature Switzerland
Reference11 articles.
1. Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoret. Comput. Sci. 511, 66–76 (2013)
2. Chen, C.-Y., Hsieh, S.-Y., Le, H.-O., Le, V.B., Peng, S.-L.: Matching cut in graphs with large minimum degree. Algorithmica 83(5), 1238–1255 (2021)
3. Chvátal, V.: Recognizing decomposable graphs. J. Graph Theory 8(1), 51–53 (1984)
4. Feghali, C., Lucke, F., Paulusma, D., and Ries, B.: Matching cuts in graphs of high girth and h-free graphs (2023)
5. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16533-7