Spanning trees with at most 4 leaves in K1, 5-free graphs.

Yuan Chen Pham Hoang Ha Dang Dinh Hanh

Published in: Discret. Math. (2019)

Keyphrases

spanning tree
minimum spanning tree
minimum spanning trees
edge disjoint
minimum cost
undirected graph
minimum weight
weighted graph
edge weights
depth first search
root node
approximation algorithms
heat kernel
minimum total cost
search engine
leaf nodes