The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs

The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs
复制标题

4 连通平面图的哈密顿循环问题是线性时间可解的

DOI:
10.1016/0196-6774(89)90012-6
复制
发表时间:
1989
期刊:
J. Algorithms
影响因子:
--
通讯作者:
Takao Nishizeki
Takao Nishizeki
中科院分区:
--
文献类型:
--
作者:
Norishige Chiba;Takao Nishizeki

文献摘要

被引文献

相似文献