A characterization of n-component graphs

The n-component graph of a graph G is the intersection graph having a point corresponding to each n-component of G and a line joining two points whenever the corresponding n-components of G share at least one point. We give a characterization of graphs which are n-component graphs of some graph, thus generalizing a theorem of Harary (1963).