Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng. Matching Cut in Graphs with Large Minimum Degree. In Ding-Zhu Du, Zhenhua Duan, Cong Tian, editors, Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings. Volume 11653 of Lecture Notes in Computer Science, pages 301-312, Springer, 2019. [doi]
@inproceedings{HsiehLLP19,
title = {Matching Cut in Graphs with Large Minimum Degree},
author = {Sun-Yuan Hsieh and Hoàng-Oanh Le and Van Bang Le and Sheng-Lung Peng},
year = {2019},
doi = {10.1007/978-3-030-26176-4_25},
url = {https://doi.org/10.1007/978-3-030-26176-4_25},
researchr = {https://researchr.org/publication/HsiehLLP19},
cites = {0},
citedby = {0},
pages = {301-312},
booktitle = {Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings},
editor = {Ding-Zhu Du and Zhenhua Duan and Cong Tian},
volume = {11653},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-26176-4},
}