Which \(k\)-trees are cover-incomparability graphs?

DOI10.1016/j.dam.2013.11.019zbMath1284.05063OpenAlexW2048927950MaRDI QIDQ2440118

Miroslava Dubcová, Pavla Pavlíková, Jana Maxová, Daniel Turzík

Publication date: 27 March 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.11.019

zbMATH Keywords

poset\(k\)-treechordal graphsimplicial vertexcover-incomparability graph

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05)

Related Items (7)

Ptolemaic and chordal cover-incomparability graphs ⋮ Composition and product of cover-incomparability graphs ⋮ Ptolemaic and planar cover-incomparability graphs ⋮ Comparability graphs among cover-incomparability graphs ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ Characterizing subclasses of cover-incomparability graphs by forbidden subposets ⋮ Cographs which are cover-incomparability graphs of posets

Cites Work

• Cover-incomparability graphs and chordal graphs
• On the complexity of cover-incomparability graphs of posets
• Cover-incomparability graphs of posets
• Which distance-hereditary graphs are cover-incomparability graphs?
• Unnamed Item
• Unnamed Item

This page was built for publication: Which \(k\)-trees are cover-incomparability graphs?