2002/10/07 by Howard Kleiman, Kleiman, Howard
Computer Science · Mathematics · #05 #Advanced Algebra and Geometry #Bayesian Methods and Mixture Models #Combinatorics (math.CO) #FOS: Mathematics #Random Matrices and Applications #math.CO #msc:05
paper · pdf · doi:10.48550/arxiv.math/0210113
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
openalex publication_date 2002/10/07 · arxiv created 2003/12/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.