Ivan Bliznets, Danil Sagunov. Lower Bounds for the Happy Coloring Problems. 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 490-502, Springer, 2019. [doi]
@inproceedings{BliznetsS19,
title = {Lower Bounds for the Happy Coloring Problems},
author = {Ivan Bliznets and Danil Sagunov},
year = {2019},
doi = {10.1007/978-3-030-26176-4_41},
url = {https://doi.org/10.1007/978-3-030-26176-4_41},
researchr = {https://researchr.org/publication/BliznetsS19},
cites = {0},
citedby = {0},
pages = {490-502},
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},
}