Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On hamiltonian Toeplitz graphs

From MaRDI portal
Publication:1348117
Jump to:navigation, search

DOI10.1016/S0012-365X(01)00136-4zbMath0988.05061MaRDI QIDQ1348117

Clemens Heuberger

Publication date: 15 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

connectivitytravelling salesman problemcirculant graphsHamilton cyclesToeplitz graphs


Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)


Related Items (13)

Coloring Toeplitz graphs ⋮ On Super Edge-Antimagic Total Labeling of Toeplitz Graphs ⋮ Hamiltonian Connectedness of Toeplitz Graphs ⋮ Structural properties of Toeplitz graphs ⋮ On planar Toeplitz graphs ⋮ Connectedness of finite distance graphs ⋮ The property of Hamiltonian connectedness in Toeplitz graphs ⋮ A comparison of lower bounds for the symmetric circulant traveling salesman problem ⋮ Coloring planar Toeplitz graphs and the stable set polytope. ⋮ Bipartite finite Toeplitz graphs ⋮ On the chromatic number of Toeplitz graphs ⋮ The Travelling Salesman Problem in symmetric circulant matrices with two stripes ⋮ Unnamed Item




This page was built for publication: On hamiltonian Toeplitz graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1348117&oldid=13484301"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki