#19053: arboricity of a undirected graph
----------------------------+----------------------------
Reporter: chaoxu | Owner:
Type: enhancement | Status: new
Priority: trivial | Milestone: sage-6.9
Component: graph theory | Keywords:
Merged in: | Authors: Chao Xu
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies: #19027
Stopgaps: |
----------------------------+----------------------------
#19027 implements matroid partition. One can use it directly to find the
arboricity of the graph. https://en.wikipedia.org/wiki/Arboricity
--
Ticket URL: <http://trac.sagemath.org/ticket/19053>
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.
For more options, visit https://groups.google.com/d/optout.
