H-admissible permutations and the HCP

Details H-admissible permutations and the HCP H-admissible permutations and the HCP

2002-10-07

arxiv.org/abs/math/0210113v2

Mathematics

Combinatorics

PDF file, 71 pages. In this version, we change Conjectures 1.1 and 1.2 so that an algorithm either obtains a hamilton circuit(

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

H-admissible permutations and the HCP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with H-admissible permutations and the HCP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and H-admissible permutations and the HCP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549001