This blog post quickly compares three different ways of enumerating the permutation graphs on \(n\) vertices. By using a canonical deletion approach, we can extend OEIS A123448 from \(n = 11\) to \(n = 14\).
There are 22576188846 unlabelled circle graphs on 13 vertices but how do we know that? This blog post looks at a few different ways of generating small circle graphs from the simplest ways up to a canonical deletion method.
A discussion about a potential title with my coauthors led to a question: What is the longest title for a maths paper?
After my old wallet began to wear at the edges, I decided to making a replacement despite having no experience. Read on to find out how the wallet turned out and to learn from some of my mistakes.