id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
8404,Computing a H-minor,ncohen,rlm,"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
",enhancement,closed,major,sage-4.4,graph theory,fixed,,,sage-4.4.alpha0,Nathann Cohen,Dmitrii Pasechnik,N/A,,,,,