On numbers of vertices of maximum degree in the spanning trees of a graph

DOI10.1016/0012-365X(94)00389-ZzbMath0858.05031OpenAlexW2091148906MaRDI QIDQ1923502

Jerzy Topp, Preben Dahl Vestergaard

Publication date: 7 October 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00389-z

zbMATH Keywords

cactusspanning treesinterpolation theorems

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
• On the feasible tree-diameter sets of graphs
• Interpolation theorem for diameters of spanning trees
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• On the diameters of spanning trees
• On upper bounds in tree-diameter sets of graphs
• Interpolation theorem for the number of end‐vertices of spanning trees

This page was built for publication: On numbers of vertices of maximum degree in the spanning trees of a graph