Well, we still have a generator for binary trees : http://www.sagemath.org/doc/reference/sage/graphs/graph_generators.html#sage.graphs.graph_generators.GraphGenerators.BalancedTree
And if you want to test whether a graph is a binary tree ( all the internal vertices have degree 3, except the root which is of degree 2), this should do : g.is_tree() and max(g.degree()) == 3 and g.degree().count(2) == 1 Nathann -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
