Embedding a forest in a graph.
Goldberg, Mark K., Magdon-Ismail, Malik (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.”
Embedding a forest in a graph.
Symmetric Laman theorems for the groups and .
Schulze, Bernd (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Subgraph isomorphism in planar graphs and related problems.
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
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.
Regular graphs and their spanning trees
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity:
Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...