Mobile version of Hanspub

文章引用说明 更多>> (返回到该文章)

Thomassen, C. (1989) The graph genus problem is NP-complete. Journal of Algorithms, 10, 568-576.

被以下文章引用: