Characterizing subclasses of cover-incomparability graphs by forbidden subposets
From MaRDI portal
Publication:2314427
DOI10.1007/s11083-018-9470-7zbMath1443.06001arXiv1801.03413MaRDI QIDQ2314427
Publication date: 22 July 2019
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.03413
06A07: Combinatorics of partially ordered sets
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C75: Structural characterization of families of graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Cites Work
- Cover-incomparability graphs and 2-colored diagrams of posets
- Cover-incomparability graphs and chordal graphs
- On the complexity of cover-incomparability graphs of posets
- Cover-incomparability graphs of posets
- Cographs which are cover-incomparability graphs of posets
- Which \(k\)-trees are cover-incomparability graphs?
- Which distance-hereditary graphs are cover-incomparability graphs?