Login / Signup

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

Panpan WangJunqing Cai
Published in: Discret. Math. (2019)
Keyphrases
  • spanning tree
  • minimum spanning tree
  • minimum spanning trees
  • minimum cost
  • undirected graph
  • edge disjoint
  • minimum weight
  • weighted graph
  • edge weights
  • depth first search
  • data structure
  • leaf nodes
  • np hard
  • random walk