Skip to main content
SpringerLink
Log in

Mixed Unit Interval Bigraphs

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2018)

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

Included in the following conference series:

Abstract

The class of intersection bigraphs of unit intervals of the real line whose ends may be open or closed is called mixed unit interval bigraphs. This class of bigraphs is a strict superclass of the class of unit interval bigraphs. We provide several infinite families of forbidden induced subgraphs of mixed unit interval bigraphs. We also pose a conjecture concerning characterization of mixed unit interval bigraphs and verify parts of it.

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 EPUB and 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

References

  1. Bogart, K.P., West, D.B.: A short proof that “proper=unit”. Discret. Math. 201, 21–23 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Corneil, D.G.: A simple 3-sweep LBFS algorithm for recognition of unit interval graphs. Discret. Appl. Math. 138, 371–379 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? (Extended abstract). In: Proceedings of the 9th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 175–180 (1998)

    Google Scholar 

  4. Das, A.K., Sahu, R.: A characterization of unit interval bigraphs of open and closed intervals. J. Graph Theory (under revision)

    Google Scholar 

  5. Das, A.K., Das, S., Sen, M.: Forbidden substructure for interval digraphs/bigraphs. Discret. Math. 339, 1028–1051 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dourado, M.C., Le, V.B., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: Mixed unit interval graphs. Discret. Math. 312, 3357–3363 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fishburn, P.C.: Interval Orders Interval Graphs. A Study of Partially Ordered Sets. Wiley, New York (1985)

    MATH  Google Scholar 

  8. Frankl, P., Maehara, H.: Open-interval graphs versus closed-interval graphs. Discret. Math. 63, 97–100 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  9. Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2, 139–152 (1995)

    Article  Google Scholar 

  10. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. North-Holland Publishing Co., Amsterdam (2004)

    MATH  Google Scholar 

  11. Hell, P., Huang, J.: Interval bigraphs and Circular arc graphs. J. Graph Theory. 46, 313–327 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Joos, F.: A characterization of mixed unit interval graphs. J. Graph Theory. 79, 267–281 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lin, I.J., West, D.B.: Interval digraphs that are indifference digraphs. In: Graph Theory, Combinatorics and Algorithms (Proceedings of the Quadrennial Conference Kalamazo, MI, 1992), pp. 751–765. Wiley-Interscience (1995)

    Google Scholar 

  14. Müller, H.: Recognizing interval digraphs and interval bigraphs in polynomial time. Discret. Appl. Math. 78, 189–205 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. Rautenbach, D., Szwarcfiter, J.L.: Unit interval graphs of open and closed intervals. J. Graph Theory. 72, 418–429 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sen, M., Sanyal, B.K.: Indifference digraphs: a generalization of indifference graphs and semi orders. SIAM J. Disc. Math. 7, 157–165 (1994)

    Article  MATH  Google Scholar 

  17. Talon, A., Kratochvíl, J.: Completion of the mixed unit interval graphs hierarchy. J. Graph Theory, 1–15 (2017). https://doi.org/10.1002/jgt.22159

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics, University of Calcutta, Kolkata, India

    Ashok Kumar Das & Rajkamal Sahu

Authors
  1. Ashok Kumar Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajkamal Sahu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ashok Kumar Das .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Delhi, New Delhi, India

    B.S. Panda

  2. University of Calcutta, Kolkata, India

    Partha P. Goswami

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Das, A.K., Sahu, R. (2018). Mixed Unit Interval Bigraphs. In: Panda, B., Goswami, P. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2018. Lecture Notes in Computer Science(), vol 10743. Springer, Cham. https://doi.org/10.1007/978-3-319-74180-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-74180-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-74179-6

  • Online ISBN: 978-3-319-74180-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation