Abstract
Abstract We present a new family of graphs, the family of P4-laden graphs strictly containing the class of P4-lite graphs introduced in (Jamison and Olariu, 1989). We first show that P4-laden graphs are brittle and next, using modular decomposition we present for this class of graphs a linear recognition algorithm as well as linear algorithms for classical optimization problems.
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.
