EUDML | Edge shift distance between trees

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

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Edge shift distance between trees”

Comparison of various distances between isomorphism classes of graphs

Bohdan Zelinka (1985)

Časopis pro pěstování matematiky

Similarity:

Relaxed graceful labellings of trees.

Van Bussel, Frank (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The number of isomorphism classes of spanning trees of a graph

Bohdan Zelinka (1978)

Mathematica Slovaca

Similarity: