Ptolemaic and planar cover-incomparability graphs
From MaRDI portal
Publication:2665829
DOI10.1007/s11083-021-09549-4OpenAlexW3127079656MaRDI QIDQ2665829
Tanja Gologranc, Baiju Sukumaran, Manoj Changat, Arun Anil
Publication date: 19 November 2021
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-021-09549-4
Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (3)
Ptolemaic and chordal cover-incomparability graphs ⋮ Composition and product of cover-incomparability graphs ⋮ Comparability graphs among cover-incomparability graphs
Cites Work
- New results on Ptolemaic graphs
- Cover-incomparability graphs and chordal graphs
- On the complexity of cover-incomparability graphs of posets
- Strictly chordal graphs are leaf powers
- Cover-incomparability graphs of posets
- Block duplicate graphs and a hierarchy of chordal graphs
- Characterizing subclasses of cover-incomparability graphs by forbidden subposets
- Cographs which are cover-incomparability graphs of posets
- Which \(k\)-trees are cover-incomparability graphs?
- Which distance-hereditary graphs are cover-incomparability graphs?
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- A characterization of ptolemaic graphs
This page was built for publication: Ptolemaic and planar cover-incomparability graphs