Class 2 graphs
Last update: 15 Dec 2020 | Contains: 1037 graphs
Vizing's theorem states that a graph can be edge-coloured in either d or d+1 colours, where d is the maximum degree of the graph. This partitions graphs into two classes, with the ones requiring d+1 colours known as class 2 graphs. The following collection was calculated by Gordon Royle (source) and lists all simple connected Class 2 graphs on up to 9 vertices.
OEIS: A099438