Which distance-hereditary graphs are cover?incomparability graphs?

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F13%3A43895366" target="_blank" >RIV/60461373:22340/13:43895366 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2013.01.017" target="_blank" >http://dx.doi.org/10.1016/j.dam.2013.01.017</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2013.01.017" target="_blank" >10.1016/j.dam.2013.01.017</a>

Result language
angličtina
Original language name
Which distance-hereditary graphs are cover?incomparability graphs?
Original language description
In this paper we deal with cover?incomparability graphs of posets, or briefly C?I graphs. These are graphs derived from posets as the edge-union of their cover graph and their incomparability graph. We answer two recently posed open questions. Which distance-hereditary graphs are C?I graphs? Which Ptolemaic (i.e. chordal distance-hereditary) graphs are C?I graphs? It follows that C?I graphs can be recognized efficiently in the class of all distance-hereditary graph whereas recognizing C?I graphs in general is known to be NP-complete
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
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)