Hamilton Circuits in Graphs and Directed Graphs
<|reference_start|>Hamilton Circuits in Graphs and Directed Graphs: 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.<|reference_end|>
@article{kleiman2000hamilton,
    title={Hamilton Circuits in Graphs and Directed Graphs},
    author={Howard Kleiman (Prof. Emer., Queensborough Community Coll. (CUNY))},
    journal={arXiv preprint arXiv:math/0012036},
    year={2000},
    archivePrefix={arXiv},
    eprint={math/0012036},
    primaryClass={math.CO cs.DS}
}