Skip to main content
Log in

Cover-Incomparability Graphs of Posets

  • Published:
Order Aims and scope Submit manuscript

A Commentary to this article was published on 18 August 2018

Abstract

Cover-incomparability graphs (C-I graphs, for short) are introduced, whose edge-set is the union of edge-sets of the incomparability and the cover graph of a poset. Posets whose C-I graphs are chordal (resp. distance-hereditary, Ptolemaic) are characterized in terms of forbidden isometric subposets, and a general approach for studying C-I graphs is proposed. Several open problems are also stated.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory, Ser. B 41, 182–208 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes. SIAM, Philadelphia (1999)

    MATH  Google Scholar 

  3. Changat, M., Klavžar, S., Mulder, H.M.: The all-paths transit function of a graph. Czech. Math. J. 51(126), 439–448 (2001)

    Article  MATH  Google Scholar 

  4. Changat, M., Mathews, J.: Induced path transit function, monotone and Peano axioms. Discrete Math. 286, 185–194 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Changat, M., Mulder, H.M., Sierksma, G.: Convexities related to path properties on graphs. Discrete Math. 290, 117–131 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Grätzer, G.: General Lattice Theory, 2nd edn. Birkhauser, Basel (1998)

    MATH  Google Scholar 

  7. Howorka, E.: A characterization of distance-hereditary graphs. Q. J. Math. Oxford Ser. 2 28, 417–420 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  8. Larrión, F., Pizaña, M.A., Villarroel-Flores, R.: Posets, clique graphs and their homotopy type. Eur. J. Comb. 29, 334–342 (2008)

    Article  MATH  Google Scholar 

  9. Mathews, A., Mathews, J.: Transit functions on posets and lattices. In: Changat, M., Klavžar, S., Mulder, H.M., Vijayakumar, A. (eds.) Convexity in Discrete Structures, Lecture Notes Ser. 5, pp. 105–116. Ramanujan Mathematical Society, Mysore (2008)

    Google Scholar 

  10. Morgana, M.A., Mulder, H.M.: The induced path convexity, betweenness and svelte graphs. Discrete Math. 254, 349–370 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mulder, H.M.: The Interval Function of a Graph. Mathematisch Centrum, Amsterdam (1980)

    MATH  Google Scholar 

  12. Mulder, H.M.: Transit functions on graphs (and posets). In: Changat, M., Klavžar, S., Mulder, H.M., Vijayakumar, A. (eds.) Convexity in Discrete Structures, Lecture Notes Ser. 5. pp. 117–130. Ramanujan Mathematical Society, Mysore (2008)

    Google Scholar 

  13. Nešetřil, J., Rödl, V.: Complexity of diagrams. Order 3, 321–330 (1987)

    Article  MathSciNet  Google Scholar 

  14. Nešetřil, J., Rödl, V.: More on the complexity of cover graphs. Comment. Math. Univ. Carol. 36, 269–278 (1995)

    MATH  Google Scholar 

  15. Rival, I.: The role of graphs in the theory of ordered sets and its applications. J. Symb. Log. 57, 269–271 (1992)

    Article  Google Scholar 

  16. Trotter, W.T.: Graphs and partially ordered sets: recent results and new directions. Congr. Numer. 116, 253–278 (1996)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sandi Klavžar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brešar, B., Changat, M., Klavžar, S. et al. Cover-Incomparability Graphs of Posets. Order 25, 335–347 (2008). https://doi.org/10.1007/s11083-008-9097-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-008-9097-1

Keywords

Navigation