EUDML | An upper bound for the shortest hamiltonian path in the symmetric euclidean case

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “An upper bound for the shortest hamiltonian path in the symmetric euclidean case”

Minimum functors on categories of Neumann trees

Rotraut Goebel (1981)

Časopis pro pěstování matematiky

Similarity:

Paths in powers of graph

Elena Wisztová (1980)

Časopis pro pěstování matematiky

Similarity:

Remarks on Hamiltonian properties of squares of graphs

Günter Schaar (1989)

Archivum Mathematicum

Similarity:

On vertices and edges in maximum path-factors of a tree

Zdzisław Skupień, Władysław Zygmunt (1980)

Fundamenta Mathematicae

Similarity: