Publisher
Springer Nature Switzerland
Reference39 articles.
1. Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the Hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73–76 (1980)
2. Bonsma, P.S.: The complexity of the matching-cut problem for planar graphs and other graph classes. J. Graph Theory 62(2), 109–126 (2009)
3. Bouquet, V., Picouleau, C.: The complexity of the perfect matching-cut problem. arXiv preprint arXiv:2011.03318 (2020)
4. 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)
5. Chvátal, V.: Recognizing decomposable graphs. J. Graph Theory 8(1), 51–53 (1984)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cutting Barnette Graphs Perfectly is Hard;Graph-Theoretic Concepts in Computer Science;2023
2. Finding Perfect Matching Cuts Faster;Lecture Notes in Computer Science;2023