#8404: Computing a H-minor
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
This patch is a linear program to compute a H minor of a graph... I hope
you will like it ! :-)
We say that a graph `G` has a `H`-minor (or that it has a graph isomorphic
to `H` as a minor), if for all `h\in H`, there exist disjoint sets `S_h
\subseteq V(G)` such that once the vertices of each `S_h` have been merged
to create a new graph `G'`, this new graph contains `H` as a subgraph.
For more information of minor theory, see
http://en.wikipedia.org/wiki/Minor_(graph_theory)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8404>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
