Collective tree spanners and routing in AT-free related graphs.
Dragan, Feodor F., Yan, Chenyu, Corneil, Derek G. (2006)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Rectangle-visibility layouts of unions and products of trees.”
Collective tree spanners and routing in AT-free related graphs.
A note on reconstructing of finite trees from small subtrees
Václav Nýdl (1990)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Distances between rooted trees
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
Bases of classes of trees closed under subdivisions
Bohdan Zelinka (1980)
Mathematica Slovaca
Similarity:
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: