Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Embedding a forest in a graph.”
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.
On tree-complete graphs
Ladislav Nebeský (1975)
Časopis pro pěstování matematiky
Similarity:
Join graphs of trees
Bohdan Zelinka (1980)
Czechoslovak Mathematical Journal
Similarity: