1
vote
1answer
124 views

Generating k-partite graphs

Does there exist an efficient algorithm for generating all non-isomorphic k-partite graphs up to a certain order $n$? I've read through the nauty tutorial, but it doesn't look like anything beyond ...
3
votes
2answers
215 views

Force-directed graph drawing in 1D?

I have a real-world graph that I wish to draw in one dimension. Here's the graph: I'd like to draw it using some kind of force-directed graph drawing method. I'm supposing this is both possible ...
4
votes
2answers
264 views

Visualizing a graph

I have a finite but huge metric graph with say 1000 vertices. It comes say as 10000x10000 symmetric matrix filled by $0,1,\dots$ and $\infty$; 0's on the diagonal and $\infty$ is for pairs of vertices ...
4
votes
3answers
477 views

Visualizing polyhedra from their 1-skeletons

Except for a few simple cases (typically pyramids and prisms) I find it hard to visualize a polyhedron from its 1-skeleton embedded in the plane, e.g. the hexahedral graph 5, as can be seen here. ...
6
votes
3answers
684 views

Looking for cubic, bipartite graphs with girth at least six and no cycles of length 8.

Aside from the Desargues graph, are there nice (at least vertex-transitive), small (say, less than 60 vertices), cubic, bipartite graphs with girth at least 6 and no 8-cycles? (or, even better, no ...