Ptolemaic and chordal cover-incomparability graphs
From MaRDI portal
(Redirected from Ptolemaic and chordal cover-incomparability graphs)
Recommendations
Cites work
- A characterization of ptolemaic graphs
- Characterizing subclasses of cover-incomparability graphs by forbidden subposets
- Cographs which are cover-incomparability graphs of posets
- Cover-incomparability graphs and chordal graphs
- Cover-incomparability graphs of posets
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- On the complexity of cover-incomparability graphs of posets
- Ptolemaic and planar cover-incomparability graphs
- Which \(k\)-trees are cover-incomparability graphs?
- Which distance-hereditary graphs are cover-incomparability graphs?
Cited in
(8)- Cover-incomparability graphs of posets
- Cographs which are cover-incomparability graphs of posets
- Which distance-hereditary graphs are cover-incomparability graphs?
- Ptolemaic and planar cover-incomparability graphs
- Composition and product of cover-incomparability graphs
- Cover-incomparability graphs and 2-colored diagrams of posets
- Cover-incomparability graphs and chordal graphs
- Recognition of chordal graphs and cographs which are cover-incomparability graphs
This page was built for publication: Ptolemaic and chordal cover-incomparability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140993)
