Which k-trees are cover-incomparability graphs?

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F14%3A43895350" target="_blank" >RIV/60461373:22340/14:43895350 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0166218X13005659" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0166218X13005659</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2013.11.019" target="_blank" >10.1016/j.dam.2013.11.019</a>

Result language
angličtina
Original language name
Which k-trees are cover-incomparability graphs?
Original language description
In this paper we dea lwith cover?incomparability graphs o fposets.It is known that the class of cover?incomparability graphs is not closed on induced subgraphs which makes the study of structural properties of these graphs difficult. In this paper we introduce the notion of s-subgraph which enables us to define forbidden s-subgraphs (i.e. graphs that cannot appear as s-subgraphs of any cover?incomparability graph). We show that the family of minimal forbidden s-subgraphs is infinite even for cover?incomparability unit-interval graphs.Using the notion of s-subgraph we also answer the question which k-trees are cover?incomparability graphs and which chordal graphs without K4 are cover?incomparabilitygraphs.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)