IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i3d10.1007_s10878-010-9322-x.html
   My bibliography  Save this article

Strongly chordal and chordal bipartite graphs are sandwich monotone

Author

Listed:
  • Pinar Heggernes

    (University of Bergen)

  • Federico Mancini

    (University of Bergen)

  • Charis Papadopoulos

    (University of Ioannina)

  • R. Sritharan

    (University of Dayton)

Abstract

A graph class is sandwich monotone if, for every pair of its graphs G 1=(V,E 1) and G 2=(V,E 2) with E 1⊂E 2, there is an ordering e 1,…,e k of the edges in E 2∖E 1 such that G=(V,E 1∪{e 1,…,e i }) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakonyi and Bono (Czechoslov. Math. J. 46:577–583, 1997). So far, very few classes have been proved to be sandwich monotone, and the most famous of these are chordal graphs. Sandwich monotonicity of a graph class implies that minimal completions of arbitrary graphs into that class can be recognized and computed in polynomial time. For minimal completions into strongly chordal or chordal bipartite graphs no polynomial-time algorithm has been known. With our results such algorithms follow for both classes. In addition, from our results it follows that all strongly chordal graphs and all chordal bipartite graphs with edge constraints can be listed efficiently.

Suggested Citation

  • Pinar Heggernes & Federico Mancini & Charis Papadopoulos & R. Sritharan, 2011. "Strongly chordal and chordal bipartite graphs are sandwich monotone," Journal of Combinatorial Optimization, Springer, vol. 22(3), pages 438-456, October.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-010-9322-x
    DOI: 10.1007/s10878-010-9322-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9322-x
    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-010-9322-x?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:22:y:2011:i:3:d:10.1007_s10878-010-9322-x. 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.