×

zbMATH — the first resource for mathematics

Counting set covers and split graphs. (English) Zbl 0953.05033
Summary: 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.

MSC:
05C30 Enumeration in graph theory
Software:
OEIS
PDF BibTeX XML Cite
Full Text: EMIS EuDML