IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-24971-1_2.html
   My bibliography  Save this book chapter

Linear Structure of Graphs and the Knotting Graph

In: Gems of Combinatorial Optimization and Graph Algorithms

Author

Listed:
  • Ekkehard Köhler

    (Brandenburgische Technische Universität, Mathematisches Institut)

Abstract

Many important graph classes, such as interval graphs, comparability graphs and AT-free graphs, show some kind of linear structure. In this paper we try to capture the notion of linearity and show some algorithmic implications. In the first section we discuss the notion of linearity of graphs and give some motivation for its usefulness for particular graph classes. The second section deals with the knotting graph, a combinatorial structure that was defined by Gallai long ago and that has various nice properties with respect to our notion of linearity. Next we define intervals of graphs in Sect. 3. This concept generalizes betweenness in graphs—a crucial notion for capturing linear structure in graphs. In the last section we give a practical example of how to use the linear structure of graphs algorithmically. In particular we show how to use these structural insights for finding maximum independent sets in AT-free graphs in $$O(n\overline{m})$$ O ( n m ¯ ) time, where $$\overline{m}$$ m ¯ denotes the number of non-edges of the graph G.

Suggested Citation

  • Ekkehard Köhler, 2015. "Linear Structure of Graphs and the Knotting Graph," Springer Books, in: Andreas S. Schulz & Martin Skutella & Sebastian Stiller & Dorothea Wagner (ed.), Gems of Combinatorial Optimization and Graph Algorithms, pages 13-27, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-24971-1_2
    DOI: 10.1007/978-3-319-24971-1_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:sprchp:978-3-319-24971-1_2. 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.