On the Complexity of Cover-Incomparability Graphs of Posets
- 53 Downloads
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.
KeywordsPoset Graph Transitive orientation NP-complete
Unable to display preview. Download preview PDF.