Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

On constant-weight TSP-tours

Scott JonesP. Mark KayllBojan MoharWalter D. Wallis — 2003

Discussiones Mathematicae Graph Theory

Is it possible to label the edges of Kₙ with distinct integer weights so that every Hamilton cycle has the same total weight? We give a local condition characterizing the labellings that witness this question's perhaps surprising affirmative answer. More generally, we address the question that arises when "Hamilton cycle" is replaced by "k-factor" for nonnegative integers k. Such edge-labellings are in correspondence with certain vertex-labellings, and the link allows us to determine (up to a constant...

Page 1

Download Results (CSV)