Ptolemaic and chordal cover-incomparability graphs
From MaRDI portal
Publication:2140993
DOI10.1007/S11083-021-09551-WOpenAlexW3139101777MaRDI QIDQ2140993FDOQ2140993
Publication date: 23 May 2022
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-021-09551-w
Recommendations
Cites Work
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- A characterization of ptolemaic graphs
- Cover-incomparability graphs of posets
- Which \(k\)-trees are cover-incomparability graphs?
- Characterizing subclasses of cover-incomparability graphs by forbidden subposets
- Cographs which are cover-incomparability graphs of posets
- Ptolemaic and planar cover-incomparability graphs
- Cover-incomparability graphs and chordal graphs
- On the complexity of cover-incomparability graphs of posets
- Which distance-hereditary graphs are cover-incomparability graphs?
Cited In (3)
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)