Login / Signup

On the Number of Spanning Trees a Planar Graph Can Have.

Kevin BuchinAndré Schulz
Published in: ESA (1) (2010)
Keyphrases
  • spanning tree
  • computational complexity
  • special case
  • undirected graph
  • edge weights