Elsevier

Discrete Mathematics

Volume 110, Issues 1–3, 11 December 1992, Pages 269-274
Discrete Mathematics

Note
Spanning trees in a cactus

https://doi.org/10.1016/0012-365X(92)90717-TGet rights and content
Under an Elsevier user license
open archive

Abstract

We prove a best possible lower bound for the number of isomorphism classes into which all rooted spanning trees of a rooted cactus partition. We announce a best possible lower bound for the number of isomorphism classes into which all spanning trees of a cactus partition.

Cited by (0)