Skip to main content
SpringerLink
Log in

On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We investigate here the intersection graphs of horizontal and vertical line segments in the plane, the so called B 0-VPG graphs. A forbidden induced subgraph characterization of B 0-VPG split graphs is given, and we present a linear time algorithm to recognize this class. Next, we characterize chordal bull-free B 0-VPG graphs and chordal claw-free B 0-VPG graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: String graphs of k-bend paths on a grid. In: Proceedings of LAGOS-2011, Electronic Notes in Discrete Mathematics, vol. 37, pp. 141–146 (2011)

  2. Asinowski A., Ries B.: Some properties of edge intersection graphs of single bend paths on a grid. Discrete Math. 212(2), 427–440 (2012)

    Article  MathSciNet  Google Scholar 

  3. Bellantoni S., Ben-Arroyo Hartman I., Przytycka T., Whitesides S.: Grid intersection graphs and boxicity. Discrete Math. 114, 41–49 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ben-Arroyo Hartman I., Newman I., Ziv R.: On grid intersection graphs. Discrete Math. 87(1), 41–52 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Biedl T., Stern M.: Edge intersection graphs with k-bend paths in grids. Discrete Math. Theor. Comput. Sci. 12(1), 1–12 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Booth K.S., Lueker G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, vol. 2, Society for Industrial and Applied Mathematics, Philadelphia (1999)

  8. Chaplick, S., Cohen, E., Stacho, J.: Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid. In: Lecture Notes in Computer Science, Vol. 6986, 319–330 (2011)

  9. Corneil D.G., Olariu S., Stewart L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10(3), 399–430 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Földes S., Hammer P.L.: Split graphs. Congr. Numer. 17, 311–315 (1977)

    Google Scholar 

  11. Golumbic M.C: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  12. Golumbic M.C., Lipshteyn M., Stern M.: Edge intersection graphs of single bend paths on a grid. Networks 54(3), 130–138 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hammer P.L., Simeone B.: On the splittance of a graph. Combinatorica 1, 275–284 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kratochvíl J., Matousěk J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62, 289–315 (1994)

    Article  MATH  Google Scholar 

  15. Lekkerkerker C., Boland J.Ch.: Representation of finite graphs by a set of intervals on the real line. Fund. Math. 51, 45–64 (1962)

    MathSciNet  MATH  Google Scholar 

  16. McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications, vol. 2. Society for Industrial and Applied Mathematics, Philadelphia (1999)

  17. Reed B., Sbihi N.: Recognizing bull-free perfect graphs. Graphs Comb. 11, 171–178 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Spinrad J.P.: Efficient Graph Representations. Fields Institute Monographs, vol. 19. American Mathematical Society, Providence (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Caesarea Rothschild Institute, University of Haifa, 31905, Haifa, Israel

    M. C. Golumbic

  2. LAMSADE, Department of Mathematics and Computer Science, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    B. Ries

Authors
  1. M. C. Golumbic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Ries
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. Ries.

Additional information

This paper is dedicated to the memories of Bruno Simeone and Peter L. Hammer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Golumbic, M.C., Ries, B. On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. Graphs and Combinatorics 29, 499–517 (2013). https://doi.org/10.1007/s00373-012-1133-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1133-7

Keywords

Search

Navigation