Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Graceful tree conjecture for infinite trees.”
Relaxed graceful labellings of trees.
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.
The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Comparison of various distances between isomorphism classes of graphs
Bohdan Zelinka (1985)
Časopis pro pěstování matematiky
Similarity:
Embedding trees into clique-bridge-clique graphs
Bohdan Zelinka (1979)
Časopis pro pěstování matematiky
Similarity: