Login / Signup

On the minimum number of spanning trees in cubic multigraphs.

Zbigniew R. Bogdanowicz
Published in: Discuss. Math. Graph Theory (2020)
Keyphrases
  • spanning tree
  • computational complexity
  • edge disjoint
  • information systems
  • small number
  • fixed number
  • genetic algorithm
  • case study
  • undirected graph
  • maximum number
  • edge weights
  • minimum spanning tree
  • root node