Counting Set Covers and Split Graphs
Gordon Royle · 2000
A bijection between split graphs and minimal covers of a set by subsets is presented. As the enumeration problem for such minimal covers has been solved, this implies that split graphs can also be enumerated.