IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00180953.html
   My bibliography  Save this paper

Detecting induced subgraphs

Author

Listed:
  • Benjamin Lévêque

    (G-SCOP_OC - Optimisation Combinatoire - G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production - UJF - Université Joseph Fourier - Grenoble 1 - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - INPG - Institut National Polytechnique de Grenoble - CNRS - Centre National de la Recherche Scientifique)

  • David Y. Lin

    (Princeton University)

  • Frédéric Maffray

    (G-SCOP_OC - Optimisation Combinatoire - G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production - UJF - Université Joseph Fourier - Grenoble 1 - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - INPG - Institut National Polytechnique de Grenoble - CNRS - Centre National de la Recherche Scientifique)

  • Nicolas Trotignon

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

Abstract

An s-graph is a graph with two kinds of edges : subdivisible edges and real edges. A realisation of an s-graphB 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 Pi(B) whose instance is a graph G and whose question is "Does G contain a realisation of B as an induced subgraph ?".

Suggested Citation

  • Benjamin Lévêque & David Y. Lin & Frédéric Maffray & Nicolas Trotignon, 2007. "Detecting induced subgraphs," Post-Print halshs-00180953, HAL.
    • Handle: RePEc:hal:journl:halshs-00180953
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00180953
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00180953/document
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nicolas Derhy & Christophe Picouleau & Nicolas Trotignon, 2008. "The four-in-a-tree problem in triangle-free graphs," Post-Print halshs-00270623, HAL.
    2. Benjamin Lévêque & Frédéric Maffray & Nicolas Trotignon, 2007. "On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph," Post-Print halshs-00180961, HAL.
    3. Nicolas Trotignon & Kristina Vuskovic, 2008. "A structure theorem for graphs with no cycle with a unique chord and its consequences," Post-Print halshs-00265957, HAL.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:halshs-00180953. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.