Frédéric Maffray

Learn More
We consider the class A of graphs that contain no odd hole, no antihole of length at least 5, and no “prism” (a graph consisting of two disjoint triangles with three disjoint paths between them) and the class A′ of graphs that contain no odd hole, no antihole of length at least 5, and no odd prism (prism whose three paths are odd). These two classes were(More)
An s-graph is a graph with two kinds 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 arbitrary length (at least one). Given an s-graph B, we study the decision problem ΠB whose instance is a graph G and question is “Does G contain a realisation of B as an(More)