A hereditary property of graphs is a class of graphs which is closed under taking induced subgraphs. For a hereditary property \(\mathscr{P}\), let \(\mathscr{P}_{n}\) denote the set of \(\mathscr{P}\) graphs on \(n\) labelled vertices. Clearly we have \(0 \leqslant\left|\mathscr{P}_{n}\right| \leqs
Penta-Extensions of Hereditary Classes of Graphs
β Scribed by Igor E. Zverovich; Inessa I. Zverovich
- Book ID
- 106406981
- Publisher
- Springer US
- Year
- 2005
- Tongue
- English
- Weight
- 296 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Let G and H be graphs. For a hereditary class of graphs P, the substitutional closure of P is deΓΏned as the class P \* consisting of all graphs which can be obtained from graphs in P by repeated substitutions. Let P be an arbitrary hereditary class for which a characterization in terms of forbidde