Obtaining hamilton cicuits in graphs and digraphs
Combinatorics
2007-05-23 v1
Abstract
This paper improves algorithms given in math.CO/0012036. Although the graph (digraph) becomes non-random as the algorithm proceeds, the probability for success stays the same. We also give examples.
Keywords
Cite
@article{arxiv.math/0210147,
title = {Obtaining hamilton cicuits in graphs and digraphs},
author = {Howard Kleiman},
journal= {arXiv preprint arXiv:math/0210147},
year = {2007}
}
Comments
PDF file. 110 pages