Is there an algorithm which provides a sequence of all simple planar graphs, unique by graph isomorphism? For instance: first all planar graphs with 1 node, then all planar graphs with 2 nodes, etc.
Note: It is okay if it generates only graphs with a minimal node degree of 1 or 2.
Asked By : 317070
Answered By : Juho
House of Graphs is a good resource. From the database, you can download all planar graphs up to 11 vertices.
For generating planar graphs even with some additional properties (e.g. connectivity), have a look at plantri by Brinkmann and McKay.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/39637
0 comments:
Post a Comment
Let us know your responses and feedback