Login / Signup
A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph.
Kenta Ozeki
Masao Tsugaki
Published in:
Electron. J. Comb. (2023)
Keyphrases
</>
spanning tree
minimum spanning tree
edge disjoint
minimum cost
minimum weight
undirected graph
minimum spanning trees
weighted graph
edge weights
minimum total cost
depth first search
graph theory
root node
connected components
directed graph