Hamilton Circuits in Graphs and Directed Graphs

Details Hamilton Circuits in Graphs and Directed Graphs Hamilton Circuits in Graphs and Directed Graphs

2000-12-06

arxiv.org/abs/math/0012036v1

Mathematics

Combinatorics

Text in Word 97, Equations in MathType, sent in a PDF file using Adobe Acrobat Writer (4.05), no figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hamilton Circuits in Graphs and Directed Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamilton Circuits in Graphs and Directed Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamilton Circuits in Graphs and Directed Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633282