On the structure of hereditary classes of graphs
Author:
- 1 December 1986
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 10 (4) , 545-551
Abstract
A class of graphs is hereditary if it is closed under taking induced subgraphs. Classes associated with graph representations have “composition sequences” and we show that this concept is equivalent to a notion of “amalgamation” which generalizes disjoint union of graphs. We also discuss how general hereditary classes of graphs are built up from representation classes.Keywords
This publication has 2 references indexed in Scilit:
- Characterizing intersection classes of graphsDiscrete Mathematics, 1985
- Characterizing circular-arc graphsBulletin of the American Mathematical Society, 1970