Abstract
A hereditary property of graphs is any class of graphs closed under isomorphism and subgraphs. Let 𝒫1, 𝒫2,…, 𝒫n be hereditary properties of graphs. We say that a graph G has property 𝒫1°𝒫2°···°𝒫n if the vertex set of G can be partitioned into n sets V1, V2,…, Vn such that the subgraph of G induced by Vi belongs to 𝒫i; i = 1, 2,…, n. A hereditary property is said to be reducible if there exist hereditary properties 𝒫1 and 𝒫2 such that ℛ = 𝒫1°𝒫2; otherwise it is irreducible. We prove that the factorization of a reducible hereditary property into irreducible factors is unique whenever the property is additive, i.e., it is closed under the disjoint union of graphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 44–53, 2000
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.