Hoàng-Oanh Le, Van Bang Le. Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. In Daniël Paulusma, Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Volume 14093 of Lecture Notes in Computer Science, pages 417-431, Springer, 2023. [doi]
@inproceedings{LeL23-2,
title = {Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths},
author = {Hoàng-Oanh Le and Van Bang Le},
year = {2023},
doi = {10.1007/978-3-031-43380-1_30},
url = {https://doi.org/10.1007/978-3-031-43380-1_30},
researchr = {https://researchr.org/publication/LeL23-2},
cites = {0},
citedby = {0},
pages = {417-431},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers},
editor = {Daniël Paulusma and Bernard Ries},
volume = {14093},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-031-43380-1},
}