Abstract
Abstract An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into paths of length at least one. Given an s-graph B, we study the decision problem Π B . Its instance is any graph G, its question is “Does G contains a realisation of B as an induced subgraph ?”. For several B's, the complexity is known and here we give the complexity for several more. We also provide results on the problem of detecting an induced cycle through two prescribed vertices. Download : Download full-size image Fig. 1 . S-graphs yielding trivially polynomial problems Download : Download full-size image Fig. 2 . Pyramids, prisms and thetas
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.
