Hi,
Does anybody knows a way to count algorithmically the number of cycles in a non-plannar graph, keeping a record of their lenghts?
I am an architect (so not quite an mathematical expert). In my PhD I am using a technique known as 'space syntax' to represent and analyze spatial systems as graphs. Syntactic axial line maps (the set of elements to be translated into the graph, lines>vertices, intersections between lines>edges) produce always non-plannar graphs. I know that on a plannar graph the problem would have a simple solution. But I can't find any solution to do it on non-plannar graphs. It would be important for my work, though...
If anybody could give me a hint on this, it would be great!
Thank You,
Miguel