User Portlet
| Discussions |
|---|
| If you prefer Maeder's numbering, you can use `UniformPolyhedron[{"Uniform", 30}]` |
| For regular Hamiltonian graphs, finding LCF embeddings is the simplest approach I know. In cases where all Hamiltonian cycles can be enumerated, simply find them all and compute the corresponding (canonicalized) LCF notations. Any with large... |