Characterizing Containment and Related Classes of Graphs, [report]

Edward R. Scheinerman
1985 unpublished
A graph is a containment graph ifone can assign sets to its vertices such that two vertices are adjacent if and only if a set assigned to one contains the set assigned to the other. A containment class of graphs is formed by considering all containment graphs for which the sets assigned to the vertices must be from a prespecified family of sets. We presenj-characterization of containment classes of graphs: as weft as characterizations for overlap and disjointedness classes. These results are
more » ... pared with previous results on intersection classes of graphs.
doi:10.21236/ada163365 fatcat:5g33ikhhwjc2pc47mlmkehxxoe