H-admissible permutations and the HCP
| dc.creator | Kleiman, Howard | |
| dc.date | 2002-10-07 | |
| dc.date | 2003-12-24 | |
| dc.date.accessioned | 2026-07-07T04:51:43Z | |
| dc.date.available | 2026-07-07T04:51:43Z | |
| dc.description | This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton circuit(cycle)or else the algorithm points to at least one vertex that cannot belong to any hamilton circuit(cycle) of G. We give criteria for determining which vertices should be examined. | |
| dc.description | PDF file, 71 pages. In this version, we change Conjectures 1.1 and 1.2 so that an algorithm either obtains a hamilton circuit(cycle), or else it points to at least one vertex that cannot belong to any graph(digraph). We give criteria for determining which vertices should be examined | |
| dc.identifier | https://arxiv.org/abs/math/0210113 | |
| dc.identifier | http://arxiv.org/abs/math/0210113 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65212 | |
| dc.subject | Combinatorics | |
| dc.subject | 05 | |
| dc.title | H-admissible permutations and the HCP | |
| dc.type | text |