On cover-incomparability graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F14%3A43897662" target="_blank" >RIV/60461373:22340/14:43897662 - isvavai.cz</a>
Result on the web
<a href="http://www.vscht.cz/mat/Colloquium/4thColloquium.pdf" target="_blank" >http://www.vscht.cz/mat/Colloquium/4thColloquium.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On cover-incomparability graphs
Original language description
In this paper we deal with posets and graphs associated to them. We concentrate on so called cover-incomparability graphs. We prove that the C-I graph recognition problem is in general NP-complete. Then we present several classes of graphs (distance-hereditary graphs, Ptolemaic graphs, $k$-trees) for which the C-I graph recognition problem is polynomial.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
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
Article name in the collection
Proceedings of 4th Scientific Colloquium
ISBN
978-80-7080-890-0
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
150-156
Publisher name
Vysoká škola chemicko-technologická v Praze
Place of publication
Praha
Event location
Praha
Event date
Jun 24, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—