Hamilton Circuits in Graphs and Directed Graphs
Combinatorics
2007-05-23 v1 Data Structures and Algorithms
Abstract
We give polynomial-time algorithms for obtaining hamilton circuits in random graphs, G, and random directed graphs, D. If n is finite, we assume that G or D contains a hamilton circuit. If G is an arbitrary graph containing a hamilton circuit, we conjecture that Algorithm G always obtains a hamilton circuit in polynomial time.
Keywords
Cite
@article{arxiv.math/0012036,
title = {Hamilton Circuits in Graphs and Directed Graphs},
author = {Howard Kleiman},
journal= {arXiv preprint arXiv:math/0012036},
year = {2007}
}
Comments
Text in Word 97, Equations in MathType, sent in a PDF file using Adobe Acrobat Writer (4.05), no figures