COMBINATORICS
2007
15 years 2 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.