Helloooooo everybody !!! I just sent the patch ! It is a bit dense, but efficiently documented :-)
I do not expect it to be reviewed very soon, but if anybody is interested I would be glad to see it merged to Sage. It also implements some stuff of independent interest (negative certificates for bipartite graphs, a constructor for permutation graphs), and perhaps somebody in the combinat crowd will be interested in being able to recognize Comparability graphs or Permutations graphs (= comparability graphs of posets of dimension 2). Well. I feel more at rest since I clicked on "needs_review" :-) Nathann http://trac.sagemath.org/sage_trac/ticket/12874 -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
