- Tytuł:
- On constant-weight TSP-tours
- Autorzy:
-
Jones, Scott
Kayll, P.
Mohar, Bojan
Wallis, Walter - Powiązania:
- https://bibliotekanauki.pl/articles/743167.pdf
- Data publikacji:
- 2003
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph labelling
complete graph
travelling salesman problem
Hamilton cycle
one-factor
two-factor
k-factor
constant-weight
local matching conditions
edge label growth-rate
Sidon sequence
well-spread sequence - Opis:
- 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 factor) the growth rate of the maximum edge-label in a "most efficient" injective metric trivial-TSP labelling.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2003, 23, 2; 287-307
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł