Journal of Integer Sequences, Vol. 3 (2000), Article 00.2.6

Counting Set Covers and Split Graphs


Gordon F. Royle
Department of Computer Science
University of Western Australia
and
Department of Combinatorics and Optimization
University of Waterloo
Email address: gordon@cs.uwa.edu.au

Abstract: 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.

Full version:  pdf,    dvi,    ps   

(Concerned with sequence A048194.)

Received May 3, 2000; published in Journal of Integer Sequences June 7, 2000.

Return to Journal of Integer Sequences home page