Characterizing intersection classes of graphs
暂无分享,去创建一个
Abstract A graph is an intersection graph if it is possible to assign sets to its vertices so that adjacency corresponds exactly to nonempty intersection. If the sets assigned to vertices must belong to a pre-specified family, the resulting class of all possible intersection graphs is called an intersection class. We characterize intersection classes. The main result is generalized for classes in which the assignment of sets to vertices must be one-to-one, as well as for classes of simplicial complexes arising as nerves of sets from a pre-specified family.
[1] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .
[2] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[3] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..