Hamiltonian cycles in circulant digraphs with two stripes
type: Item
instance of: scholarly article
title: Hamiltonian cycles in circulant digraphs with two stripes
zbMATH Open document ID: 0895.05041
DOI: 10.1016/S0012-365X(96)00298-1
author: Rainer E. Burkard
author: Eranda Çela
author: Qifan Yang
author: Gerhard J. Woeginger
published in: Discrete Mathematics
publication date: 1998-02-17T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1109971
zbMATH Keywords: Hamiltonian cycles
zbMATH Keywords: circulant digraphs
zbMATH Keywords: stripes
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: circulant distance matrix
zbMATH Keywords: Hamiltonian digraphs
zbMATH Keywords: nonzero stripes
MaRDI profile type: Publication
cites work: Q4773298
cites work: Efficiently solvable special cases of bottleneck travelling salesman problems
cites work: Circulants and their connectivities
cites work: Connectivity of circulant digraphs
cites work: Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
cites work: Q3768703
cites work: ON THE PROBLEM OF JACOBSTHAL
cites work: Universal conditions for algebraic travelling salesman problems to be efficiently solvable
description: scientific article; zbMATH DE number 1109971