On constant-weight TSP-tours

DOI10.7151/dmgt.1203zbMath1052.05063MaRDI QIDQ4823309

Bojan Mohar, Walter D. Wallis, P. Mark Kayll, Scott O. Jones

Publication date: 27 October 2004

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0b5a199e94075a88138a140d6b1beaec75914652

zbMATH Keywords

Hamiltonian cycle; traveling salesman problem; complete graph; graph labeling; \(k\)-factor

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C38: Paths and cycles

11B75: Other combinatorial number theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C78: Graph labelling (graceful graphs, bandwidth, etc.)