The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
Displaying similar documents to “On the kernel of tree incidence matrices.”
The number of isomorphism classes of spanning trees of a graph
Partitionability of trees
Bohdan Zelinka (1988)
Czechoslovak Mathematical Journal
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.
Small integral trees.
Brouwer, A.E. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The block connectivity of random trees.
McGrae, Andrew R.A., Zito, Michele (2009)
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...
The number of -matchings in almost every tree is a zero residue.
Alon, Noga, Haber, Simi, Krivelevich, Michael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: