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 ...
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 ...
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 ...
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. ...