Interpolation theorem for the number of end‐vertices of spanning trees

DOI10.1002/jgt.3190070209zbMath0482.05032OpenAlexW2076173604MaRDI QIDQ3939828

Seymour Schuster

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

zbMATH Keywords

spanning treeendvertex

Mathematics Subject Classification ID

Trees (05C05)

Related Items (9)

Matroid tree graphs and interpolation theorems ⋮ On numbers of vertices of maximum degree in the spanning trees of a graph ⋮ Interpolation theorems for a family of spanning subgraphs ⋮ Interpolation theorems for graphs, hypergraphs and matroids ⋮ Interpolation theorems for domination numbers of a graph ⋮ Spanning subgraphs of a hypercube. IV: Rooted trees ⋮ Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size ⋮ Laplacian matrices of graphs: A survey ⋮ Interpolation theorem for a continuous function on orientations of a simple graph

This page was built for publication: Interpolation theorem for the number of end‐vertices of spanning trees