Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem

DOI10.1137/0605045zbMATH Open0551.05051OpenAlexW2007252337MaRDI QIDQ3344231FDOQ3344231

Authors: Robert Garfinkel, P. S. Sundararaghavan 

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605045

Recommendations

• Hamiltonian cycles in circulant digraphs with two stripes
• On hamiltonian Toeplitz graphs
• scientific article; zbMATH DE number 1192948
• The Hamiltonian property of generalized de Bruijn digraphs
• scientific article; zbMATH DE number 5064035

zbMATH Keywords

Hamiltonian cyclestriped digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems

This page was built for publication: Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344231)