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

The four-in-a-tree problem in triangle-free graphs

Author

Listed:
  • Nicolas Derhy

    (CEDRIC - Centre d'études et de recherche en informatique et communications - ENSIIE - Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise - CNAM - Conservatoire National des Arts et Métiers [CNAM] - HESAM - HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université)

  • Christophe Picouleau

    (CEDRIC - Centre d'études et de recherche en informatique et communications - ENSIIE - Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise - CNAM - Conservatoire National des Arts et Métiers [CNAM] - HESAM - HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université)

  • Nicolas Trotignon

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

Abstract

The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question : how does look like a triangle-free graph such that no induced tree covers four given vertices ? Our main result says that any such graph must have the "same structure", in a sense to be defined precisely, as a square or a cube. We provide an O(nm)-time algorithm that given a triangle-free graph G together with four vertices outputs either an induced tree that contains them or a partition of V(G) certifying that no such tree exists. We prove that the problem of deciding whether there exists a tree T covering the four vertices such that at most one vertex of T has degree at least 3 is NP-complete.

Suggested Citation

  • Nicolas Derhy & Christophe Picouleau & Nicolas Trotignon, 2008. "The four-in-a-tree problem in triangle-free graphs," Post-Print halshs-00270623, HAL.
    • Handle: RePEc:hal:journl:halshs-00270623
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00270623
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Benjamin Lévêque & David Y. Lin & Frédéric Maffray & Nicolas Trotignon, 2007. "Detecting induced subgraphs," Documents de travail du Centre d'Economie de la Sorbonne b07049, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    2. Benjamin Lévêque & David Y. Lin & Frédéric Maffray & Nicolas Trotignon, 2007. "Detecting induced subgraphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00180953, HAL.
    3. Benjamin Lévêque & David Y. Lin & Frédéric Maffray & Nicolas Trotignon, 2007. "Detecting induced subgraphs," Post-Print halshs-00180953, HAL.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    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.

    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-00270623. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.