IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i1d10.1007_s10878-020-00670-5.html
   My bibliography  Save this article

On characterizations for subclasses of directed co-graphs

Author

Listed:
  • Frank Gurski

    (University of Düsseldorf)

  • Dominique Komander

    (University of Düsseldorf)

  • Carolin Rehs

    (University of Düsseldorf)

Abstract

Undirected co-graphs are those graphs which can be generated from the single vertex graph by disjoint union and join operations. Co-graphs are exactly the $$P_4$$ P 4 -free graphs (where $$P_4$$ P 4 denotes the path on 4 vertices). The class of co-graphs itself and several subclasses haven been intensively studied. Among these are trivially perfect graphs, threshold graphs, weakly quasi threshold graphs, and simple co-graphs. Directed co-graphs are digraphs which can be defined by, starting with the single vertex graph, applying the disjoint union, order composition, and series composition. By omitting the series composition we obtain the subclass of oriented co-graphs which has been analyzed by Lawler in the 1970s. The restriction to linear expressions was recently studied by Boeckner. Until now, there are only a few versions of subclasses of directed co-graphs. By transmitting the restrictions of undirected subclasses to the directed classes, we define the corresponding subclasses for directed co-graphs. We consider directed and oriented versions of threshold graphs, simple co-graphs, co-simple co-graphs, trivially perfect graphs, co-trivially perfect graphs, weakly quasi threshold graphs and co-weakly quasi threshold graphs. For all these classes we give characterizations by finite sets of minimal forbidden induced subdigraphs. Additionally, we analyze the relations between these graph classes.

Suggested Citation

  • Frank Gurski & Dominique Komander & Carolin Rehs, 2021. "On characterizations for subclasses of directed co-graphs," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 234-266, January.
    • Handle: RePEc:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00670-5
    DOI: 10.1007/s10878-020-00670-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00670-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00670-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00670-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.