collaborators

1 paper

math.CO2000

Hamilton Circuits in Graphs and Directed Graphs

Howard Kleiman

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 cir…