Proof Writing & Problem Solving · Superchallenge problem

A proof checks a claim for every graph on $5$ vertices (each of the $10$ pairs of vertices is joined by an edge or not). The write-up treats two graphs as the same case when relabelling the vertices turns one into the other ("without loss of generality"). How many cases must the write-up contain?