A generalization of Hamiltonian cycles for trees

Ladislav Nebeský

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

Displaying similar documents to “A generalization of Hamiltonian cycles for trees”

On tree-complete graphs

Ladislav Nebeský (1975)

Časopis pro pěstování matematiky

Similarity:

Extended trees of graphs

Bohdan Zelinka (1994)

Mathematica Bohemica

Similarity:

An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.

Steiner distance in graphs

Gary Chartrand, Ortrud R. Oellermann, Song Lin Tian, Hung Bin Zou (1989)

Časopis pro pěstování matematiky

Similarity: