Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton-connected is an NP-complete problem. Hamiltonian and Hamilton-connected graphs have diverse applications in computer science and electrical engi...
| Published in: | Complexity |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Online Access: | http://dx.doi.org/10.1155/2021/6684784 |