Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ENDM

2007

2007

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.

Related Content

Added |
13 Dec 2010 |

Updated |
13 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
ENDM |

Authors |
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon |

Comments (0)