Hamiltonian properties of Toeplitz graphs
From MaRDI portal
Publication:1126180
DOI10.1016/0012-365X(95)00111-9zbMATH Open0864.05060MaRDI QIDQ1126180FDOQ1126180
Gert A. Tijssen, Zsolt Tuza, Jack A. A. van der Veen, Tudor Zamfirescu, Christina Maria Zamfirescu, René van Dal
Publication date: 9 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Circulants and their connectivities
- The traveling salesman problem in graphs with 3-edge cutsets
- Halin graphs and the travelling salesman problem
- Algebraic methods for Toeplitz-like matrices and operators
- Title not available (Why is that?)
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
- Connectivity of circulant digraphs
Cited In (24)
- On hamiltonian Toeplitz graphs
- Coloring planar Toeplitz graphs and the stable set polytope.
- Commutativity and compactness of \(k\)th order slant Toeplitz operators
- Exponents of primitive directed Toeplitz graphs
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
- Two types of discrete Sobolev inequalities on a weighted Toeplitz graph
- A hierarchical structure for the sharp constants of discrete Sobolev inequalities on a weighted complete graph
- Coloring Toeplitz graphs
- The property of Hamiltonian connectedness in Toeplitz graphs
- Counting independent sets in Riordan graphs
- Characterizing bipartite Toeplitz graphs
- Title not available (Why is that?)
- Connectedness of finite distance graphs
- An intermediate value theorem for the decycling numbers of Toeplitz graphs
- Structural properties of Toeplitz graphs
- Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7
- On Super Edge-Antimagic Total Labeling of Toeplitz Graphs
- The maximum travelling salesman problem on symmetric Demidenko matrices
- Riordan graphs I: structural properties
- On the chromatic number of Toeplitz graphs
- Title not available (Why is that?)
- On planar Toeplitz graphs
- Hamiltonian Connectedness of Toeplitz Graphs
- Decomposition of kth Order Slant Toeplitz Operators
This page was built for publication: Hamiltonian properties of Toeplitz graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126180)
