Journal of Applied Sciences ›› 1990, Vol. 8 ›› Issue (1): 36-40.
• Articles • Previous Articles Next Articles
HU MEICHKNG
Received:
Revised:
Online:
Published:
Abstract: Planarity testing algorithm of graphs is a quite complex process. In this paper, we give a much simpler testing algorithm of the Hamiltonian graph. For the algorithms to test graphs for planarity, refer to the references.
HU MEICHKNG. A PLANARITY TESTING ALGORITHM OF HAMILTONIAN GRAPH[J]. Journal of Applied Sciences, 1990, 8(1): 36-40.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jas.shu.edu.cn/EN/
https://www.jas.shu.edu.cn/EN/Y1990/V8/I1/36