On tree-complete graphs
Ladislav Nebeský (1975)
Časopis pro pěstování matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Extended trees of graphs”
On tree-complete graphs
Partitionability of trees
Bohdan Zelinka (1988)
Czechoslovak Mathematical Journal
Similarity:
The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
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...