Abstract
In this paper we first show that the pathwidth problem for chordal graphs is NP-hard.Then we give polynomial algorithms for subclasses. One of those classes are the k-starlike graphs – a generalization of split graphs. The other class are the primitive starlike graphs – a class of graphs where the intersection behavior of maximal cliques is strongly restricted.
Sign-in/Register to access full text options 
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.
