top of page
Maximal Linklessly Embeddable Graphs
These lists were computed using the nauty program of Brendan McKay, the Mathematica program written by Ramin Naimi, and a Python script written by Ryan Odeneal. The lists are complete up to and including order 11, the rest are just samples.
References
Naimi, R., Odoneal, R., Pavelescu, A., & Pavelescu, E. (2021). The Complement Problem for Linklessly Embeddable Graphs. arXiv preprint arXiv:2108.12946.
bottom of page