The number of isomorphism classes of spanning trees of a graph

Bohdan Zelinka

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “The number of isomorphism classes of spanning trees of a graph”

Bases of classes of trees closed under subdivisions

Bohdan Zelinka (1980)

Mathematica Slovaca

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.

Partitionability of trees

Bohdan Zelinka (1988)

Czechoslovak Mathematical Journal

Similarity: