Skip to main content
SpringerLink
Log in

Separator Theorems for Interval Graphs and Proper Interval Graphs

  • Conference paper
Algorithms and Discrete Applied Mathematics (CALDAM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8959))

Included in the following conference series:

  • 1260 Accesses

Abstract

C.L.Monma and V.K.Wei [1986, J. Comb. Theory, Ser-B, 41, 141-181] proposed a unified approach to characterize several subclasses of chordal graphs using clique separator. The characterizations so obtained are called separator theorems. Separator theorems play an important role in designing algorithms in subclasses of chordal graphs. In this paper, we obtain separator theorems for interval graphs and proper interval graphs, which are subclasses of chordal graphs, following the framework of Monma and Wei.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gilmore, P.C., Hoffman, A.J.: A Characterization of Comparability Graphs and Interval Graphs. Canadian J. Maths. 16, 539–548 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  2. Golumbic, M.C. (ed.): Interval Graphs and Related Topics. Discrete Math. 55 (1985)

    Google Scholar 

  3. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  4. Monma, C.L., Wei, V.K.: Intersection Graphs of Paths in a Tree. J. Combin. Theory Ser-B 41, 141–181 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  5. Panda, B.S., Mohanty, S.P.: Intersection Graphs of Vertex Disjoint Paths in a Tree. Discrete Math. 146, 179–209 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Panda, B.S.: The forbidden Subgraph Characterization of Directed Vertex Graphs. Discrete Math 196, 239–256 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Papadimitriou, C., Yanakakis, M.M.: Scheduling Interval Ordered Tasks. SIAM J. Comput. 8, 405–409 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  8. Roberts, F.S.: Discrete Mathematical Model with Applications to Social, Biological and Environmental Problems. Prentice Hall, Englewood Cliff (1976)

    Google Scholar 

  9. Roberts, F.S.: Indifference Graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139–146. Academic Press, New York (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India

    B. S. Panda

Authors
  1. B. S. Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, I.I.T. Kanpur, 208016, India

    Sumit Ganguly

  2. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, BC, Canada

    Ramesh Krishnamurti

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Panda, B.S. (2015). Separator Theorems for Interval Graphs and Proper Interval Graphs. In: Ganguly, S., Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer, Cham. https://doi.org/10.1007/978-3-319-14974-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14974-5_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14973-8

  • Online ISBN: 978-3-319-14974-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation