A CHARACTERIZATION OF CHAIN GRAPHS

摘要

We introduce a new class of graphs called chain graphs as being a generalization of the interval graphs. We characterize a chain graph G by using a generalized tree structure on its set of maximal cliques with respect to some conditions on vertices of G. We give also a second characterization which calls upon the C-critical graphs.