Abstract

A graph property is any class of graphs that is closed under isomorphisms. A graph property P is hereditary if it is closed under taking subgraphs; it is compositive if for any graphs G 1,G 2 ∈ P there exists a graph G ∈ P containing both G 1 and G 2 as subgraphs.Let H be any given graph on vertices υ 1, ..., υ n , n ≥ 2. A graph property P is H-factorizable over the class of graph properties ℙ if there exist P 1, ..., P n ∈ ℙ such that P consists of all graphs whose vertex sets can be partitioned into n parts, possibly empty, satisfying: 1. for each i, the graph induced by the i-th non-empty partition part is in P i , and 2. for each i and j with i ≠ j, there is no edge between the i-th and j-th parts if υ i and υ j are non-adjacent vertices in H. If a graph property P is H-factorizable over ℙ and we know the graph properties P 1, ..., P n , then we write P = H[P 1, ..., P n ]. In such a case, the presentation H[P 1, ..., P n ] is called a factorization of P over ℙ. This concept generalizes graph homomorphisms and (P 1, ..., P n )-colorings.In this paper, we investigate all H-factorizations of a graph property P over the class of all hereditary compositive graph properties for finite graphs H. It is shown that in many cases there is exactly one such factorization.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.