#14528: Additional doctests for the graph module
---------------------------------+------------------------------------------
Reporter: azi | Owner: tbd
Type: PLEASE CHANGE | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: PLEASE CHANGE | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by azi):
Replying to [comment:16 ncohen]:
> > As for the is_perfect method. The line graph of a bipartite graph is
in fact the Cartesian product of complete graphs.
>
> Of a *complete* bipartite graph ?
Yes correct. I am making this random mistakes all the time. Your
suggestion for is_perfect makes sense in this case. Though I think it
still covers only a small % of input graphs.
>
> > Hence an even faster way to recognize them is use the Cartesian
factorisation algorithm and check that each component is a clique.
>
> Yepyep, but line graphs of bipartite graphs are a larger class of
perfect graphs. May even be included in ISGCI !
>
> > In the near future I'd really love to have the poly time algorithm for
testing perfect graphs.
>
> Ahahahah. Yep, now that would be something we could boast about `:-)`
Yeah! I think it *should* not be that hard to implement but I don't think
anyone is really using this test that much...
PS. I have updated the patch, could you please check if its fine with you?
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14528#comment:17>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.