The Path Cover and Related Problems on Circular-Arc Graphs and Distance-Hereditary Graphs
博士 === 國立中正大學 === 資訊工程所 === 93 === A Hamiltonian path of a graph G is a simple path that visits each vertex of G exactly once. A Hamiltonian cycle of a graph is a simple cycle with the same property. The Hamiltonian path and Hamiltonian cycle problems involve testing whether a Hamiltonian path and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/41862941357526574222 |