On economical set representations of graphs
Jing Kong, Yaokun Wu · Discrete Mathematics & Theoretical Computer Science · 2009
Graphs and Algorithms In this paper we discuss the bounds of and relations among various kinds of intersection numbers of graphs. Especially, we address extremal graphs with respect to the established bounds. The uniqueness of the minimum-size intersection representations for some graphs is also studied. In the course of this work, we introduce a superclass of chordal graphs, defined in terms of a generalization of simplicial vertex and perfect elimination ordering.