Distributing Vertices Carefully on a Hamiltonian Cycle

Document Type

Article

Publication Date

2011

Publication Title

AKCE International Journal of Graphs and Combinatorics

ISSN

0972-8600

Abstract

Given a graph with sufficient minimum degree, the results contained in this work produce a Hamiltonian cycle on which specified vertices are placed at approximately prescribed intervals along the cycle. The results improve upon known results in the area by significantly decreasing the error in the approximation when the order of the graph is large.

Link to Full Text

Share

COinS