数学物理学报(英文版) ›› 1988, Vol. 8 ›› Issue (1): 25-27.

• 论文 • 上一篇    下一篇

RECOGNIZING A MEDIATE GRAPH TO BE HAMILTONIAN

孙惠泉   

  1. Beijing College of Posts and Telecommunications
  • 收稿日期:1985-07-20 出版日期:1988-03-25 发布日期:1988-03-25

RECOGNIZING A MEDIATE GRAPH TO BE HAMILTONIAN

Sun Huiquan   

  1. Beijing College of Posts and Telecommunications
  • Received:1985-07-20 Online:1988-03-25 Published:1988-03-25

摘要: We prove that the existence of a directed Hamiltonian cycle in a mediate graph is an NP-complete problem.

Abstract: We prove that the existence of a directed Hamiltonian cycle in a mediate graph is an NP-complete problem.