Ask Your Question

nkothari's profile - activity

2014-01-30 14:58:35 +0200 received badge  Student (source)
2014-01-28 10:32:18 +0200 received badge  Supporter (source)
2014-01-28 00:32:09 +0200 asked a question enumerate subgraphs with edge sets

Hi,

I have been using Sage for the past few months now, and I use the subgraph_search_iterator() heavily. So far, I did not care for the edge set of the subgraph found. But now that I do, it seems that the subgraph_search_iterator() returns only the vertex sets of the corresponding subgraphs.

In particular, I am looking for subdivisions of K3,3 in an input graph. But I want the additional constraint that two fixed vertices (say, u and v) must be branch vertices of the subgraph found - by branch vertices I mean vertices of degree exactly 3 in the subgraph.

Any help would be greatly appreciated. Thanks!