Skip to main content
SpringerLink
Log in

Posets with interval upper bound graphs

  • Published:
Order Aims and scope Submit manuscript

Abstract

Competition graphs of transitive acyclic digraphs are strict upper bound graphs. This paper characterizes those posets, which can be considered transitive acyclic digraphs, which have upper bound graphs that are interval graphs. The results proved here may shed some light on the open question of those digraphs which have interval competition 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. J. E. Cohen (1978) Food Webs and Niche Space, Princeton University Press, Princeton, NJ.

    Google Scholar 

  2. D. A. Diny (1985) Bound graphs resulting from certain digraphs and partially ordered sets, PhD Dissertation, Bowling Green State University, Bowling Green, OH.

  3. M. Golumbic (1980) Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, NY., p. 172.

    Google Scholar 

  4. C. B. Lekkerkerker and J. C. Boland (1962) Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51, 45–64.

    Google Scholar 

  5. J. R. Lundgren, and J. S. Maybee (1984) Food webs with interval competition graphs, Graphs and Applications, Proceedings of the First Colorado Symposium on Graph Theory, John Wiley, New York, pp. 231–244.

    Google Scholar 

  6. F. R. McMorris and T. Zaslavsky (1982) Bound graphs of a partially ordered set, J. Combinatorics, Information & System Sciences, 7, 134–138.

    Google Scholar 

  7. I. Rabinovitch (1973) PhD Dissertation, Dartmouth College, Hanover, NH.

  8. J. E. Steif (1982) Frame dimension, generalized competition graphs, and forbidden sublist characterizations, Henry Rutgers Thesis, Dept. of Math., Rutgers Univer., New Brunswick, NJ.

  9. E. S. Wolk (1962) The comparability graph of a tree, Proc. Amer. Math. Soc. 13, 789–795.

    Google Scholar 

  10. E. S. Wolk (1965) A note on the comparability graph of a tree, Proc. Amer. Math. Soc. 16, 17–20.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Wisconsin — Green Bay, 2420 Nicolet Drive, 543017001, Green Bay, WI, USA

    Debra D. Scott

Authors
  1. Debra D. Scott
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by P. Hell

This material is taken from Chapter 3 of my (maiden name Diny) PhD Dissertation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scott, D.D. Posets with interval upper bound graphs. Order 3, 269–281 (1986). https://doi.org/10.1007/BF00400290

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00400290

AMS (MOS) subject classification (1980)

Key words

Search

Navigation