Author:
Chiba Norishige,Nishizeki Takao
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference6 articles.
1. and , The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. Tech. Rept. TRECIS84004, Dept. of Elect. Communs., Tohoku Univ. (1984).
2. The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
3. The Four-Color Problem, Academic Press, New York (1967).
4. A theorem on paths in planar graphs
5. A theorem on planar graphs
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献