The hamiltonian numbers of graphs and digraphs
博士 === 國立中山大學 === 應用數學系研究所 === 99 === The hamiltonian number problem is a generalization of hamiltonian cycle problem in graph theory. It is well known that the hamiltonian cycle problem in graph theory is NP-complete [16]. So the hamiltonian number problem is also NP-complete. On the other hand, th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/36343456545313729368 |