Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
From MaRDI portal
Publication:1065035
DOI10.1016/0012-365X(84)90061-XzbMath0576.05057MaRDI QIDQ1065035
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
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 domination numbers of a graph ⋮ Interpolation theorem for a continuous function on orientations of a simple graph
Cites Work
This page was built for publication: Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
