Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In this video they talk about generating all the homeomorphically irreducible trees of size 10.

I was wondering if there is a generating algorithm for generating all the homeomorphically irreducible trees of size n? by generating algorithm I do not mean one that generates all possible trees and then tests and removes the undesired ones, but one that generates one after the other, or by some transformation of a acceptable tree to a new acceptable tree.

share|cite|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.