Guichard-Combinatorics-Graph-Theory · Problem 6.2.5

Pólya–Redfield Counting

Mathematics — Probability · burnsides-theorem

Problem

Find the number of non-isomorphic graphs on 5 vertices ``by hand'', that is, using the method of example 6.2.7.