Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10386850" target="_blank" >RIV/00216208:11320/19:10386850 - isvavai.cz</a>
Alternative codes found
RIV/60461373:22340/19:43918474
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=_m4.d7XkkI" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=_m4.d7XkkI</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11083-018-9470-7" target="_blank" >10.1007/s11083-018-9470-7</a>
Alternative languages
Result language
angličtina
Original language name
Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets
Original language description
In this paper we continue investigations of cover-incomparability graphs of finite partially ordered sets (see Brear et al. Order 25:335-347 2008; Brear et al. Discret. Appl. Math. 158:1752-1759 2010; Brear et al. Order 32(2):179-187 2015; Brear et al. 2014 and Maxova et al. Order 26:229-236 2009; Maxova and Turzik Discret. Appl. Math. 161:2095-2100 2013). We consider in some detail the distinction between cover-preserving subsets and isometric subsets of a partially ordered set. This is critical to understanding why forbidden subposet characterizations of certain classes of cover-incomparability graphs in Brear et al. (Order 25:335-347 2008) and Brear et al. (Order 32(2):179-187 2015) are not valid as presented. Here we provide examples, investigate the root of the difficulties, and formulate and prove valid revisions of these characterizations.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Order
ISSN
0167-8094
e-ISSN
—
Volume of the periodical
36
Issue of the periodical within the volume
2
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
10
Pages from-to
349-358
UT code for WoS article
000476618800011
EID of the result in the Scopus database
2-s2.0-85052507297