Skip to main content
SpringerLink
Log in

On the Complexity of Cover-Incomparability Graphs of Posets

  • Published:
Order Aims and scope Submit manuscript

Abstract

In this paper we show that the recognition problem for C-I graphs of posets is NP-complete. On the other hand, we prove that induced subgraphs of C-I graphs are exactly complements of comparability graphs, and hence the recognition problem for induced subgraphs of C-I graphs of posets is polynomial.

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. Brandstädt, A., Le, V.B., Spinard, J.: Graph Classes. SIAM, Philadelphia (1999)

    MATH  Google Scholar 

  2. Brešar, B., Changat, M., Klavžar, S., Kovše, M., Mathews, J., Mathews, A.: Cover-incomparability graphs of posets. Order 25, 335–347 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brigtwell, G.: On the complexity of diagram testing. Order 10, 297–303 (1993)

    Article  MathSciNet  Google Scholar 

  4. Gallai, T.: Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hung. 18, 25–66 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completness. Freeman, New York (1979)

    Google Scholar 

  6. Golumbic, M.: Algorithmic graph theory and perfect graphs, academic press, 2nd edn. Ann. Discrete Math. 57 (2004)

  7. Lovász, L.: Combinatorial Problems and Exercises. Akadémiai Kaidó, Budapest (1979)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. 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 

  10. Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indag. Math. 39, 406–424 (1977)

    MathSciNet  Google Scholar 

  11. 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 

  12. 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

  1. Department of Mathematics, Institute of Chemical Technology, Prague, Technická 5, 166 28  Praha 6, Czech Republic

    Jana Maxová, Pavla Pavlíková & Daniel Turzík

  2. Institute for Theoretical Computer Science (ITI), Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    Jana Maxová

Authors
  1. Jana Maxová
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavla Pavlíková
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Turzík
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jana Maxová.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maxová, J., Pavlíková, P. & Turzík, D. On the Complexity of Cover-Incomparability Graphs of Posets. Order 26, 229–236 (2009). https://doi.org/10.1007/s11083-009-9117-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-009-9117-9

Keywords

Search

Navigation