External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Lower Bounds for the Happy Coloring Problems

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]

Authors

Ivan Bliznets

This author has not been identified. Look up 'Ivan Bliznets' in Google

Danil Sagunov

This author has not been identified. Look up 'Danil Sagunov' in Google
runs on