Obtaining hamilton cicuits in graphs and digraphs

Kleiman, Howard

Obtaining hamilton cicuits in graphs and digraphs

Authors

Description

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.
PDF file. 110 pages

Keywords

Combinatorics, 05

URI

http://salesiana.dossiersoluciones.com/handle/123456789/65238

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0210147
http://arxiv.org/abs/math/0210147

Collections

arXiv

Full item page

Obtaining hamilton cicuits in graphs and digraphs

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Consulte el texto completo en el siguiente enlace:

Collections