Login / Signup

-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees.

Michael Kubesa
Published in: Discuss. Math. Graph Theory (2005)
Keyphrases
  • spanning tree
  • minimum spanning tree
  • minimum spanning trees
  • minimum cost
  • edge disjoint
  • undirected graph
  • minimum weight
  • edge weights
  • weighted graph
  • depth first search
  • root node
  • minimum total cost
  • globally optimal