Abstract
Abstract The clique-width of a graph G is the minimum number of labels that are required for dening G by an expression based on graph operations using vertex labels. The Partner limited graphs ( PL -graphs for short) are defined to be graphs with a limited number of P 4 's. We prove that PL -graphs are of bounded clique-width. It follows that a large number of optimization problems have polynomial solutions for this family of graphs
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 callDisclaimer: 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.
