Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: constant-weight

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

On constant-weight TSP-tours

100%

Jones S., Kayll P., Mohar B., Wallis W.

Discussiones Mathematicae Graph Theory

2003

tom 23

nr 2

287-307

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Jones S.

1 Kayll P.

1 Mohar B.

1 Wallis W.

1 2003

Wyniki wyszukiwania

On constant-weight TSP-tours