An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On computing the distinguishing numbers of trees and forests.”
An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
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.
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
Dariusz Dereniowski (2009)
Discussiones Mathematicae Graph Theory
Similarity:
A vertex k-ranking of a simple graph is a coloring of its vertices with k colors in such a way that each path connecting two vertices of the same color contains a vertex with a bigger color. Consider the minimum vertex ranking spanning tree (MVRST) problem where the goal is to find a spanning tree of a given graph G which has a vertex ranking using the minimal number of colors over vertex rankings of all spanning trees of G. K. Miyata et al. proved in [NP-hardness proof and an approximation...
Symmetric Laman theorems for the groups and .
Schulze, Bernd (2010)
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:
Bases of classes of trees closed under subdivisions
Bohdan Zelinka (1980)
Mathematica Slovaca
Similarity:
Spanning trees with leaves bounded by independence number.
Sun, Ling-li (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
Three new heuristics for the Steiner problem in graphs.
Diané, M., Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: