English

Counting Spanning trees in double nested graphs

Combinatorics 2016-05-17 v1

Abstract

In this paper we give a linear time algorithm for computing the number of spanninig trees in double nested graphs.

Keywords

Cite

@article{arxiv.1605.04760,
  title  = {Counting Spanning trees in double nested graphs},
  author = {Fernando Tura},
  journal= {arXiv preprint arXiv:1605.04760},
  year   = {2016}
}