## Abstract An Erratum has been published for this article in Journal of Graph Theory 50:261, 2005. A graph property (i.e., a set of graphs) is hereditary (respectively, induced‐hereditary) if it is closed under taking subgraphs (resp., induced‐subgraphs), while the property is additive if it is c
Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties
✍ Scribed by Alastair Farrugia; Peter Mihók; R. Bruce Richter; Gabriel Semanišin
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 28 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The original article to which this Erratum refers was published in Journal of Graph Theory 49:11–27.
No Abstract.
📜 SIMILAR VOLUMES
## Abstract The objective of this study was to determine the leaching of Ba, Si, and Sr from four dental composites: Restolux (RX), Micronew (M), Renew (RW), and Choice (C) and to correlate the effects of such leaching with flexure strength and modulus of elasticity. The specimens were 3 × 3 × 25‐m
A hereditary property of graphs is any class of graphs closed under isomorphism and subgraphs. Let P 1 , P 2 , . . . , P n be hereditary properties of graphs. We say that a graph G has property P 1 . . , V n such that the subgraph of G induced by V i belongs to P i ; i = 1, 2, . . . , n. A heredita