Interpolation theorem for the number of end‐vertices of spanning trees
From MaRDI portal
Publication:3939828
DOI10.1002/jgt.3190070209zbMath0482.05032MaRDI QIDQ3939828
Publication date: 1983
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190070209
05C05: Trees
Related Items
Interpolation theorem for a continuous function on orientations of a simple graph, Interpolation theorems for a family of spanning subgraphs, Spanning subgraphs of a hypercube. IV: Rooted trees, Laplacian matrices of graphs: A survey, Matroid tree graphs and interpolation theorems, Interpolation theorems for graphs, hypergraphs and matroids, Interpolation theorems for domination numbers of a graph, On numbers of vertices of maximum degree in the spanning trees of a graph