On the computational complexity of partial covers of Theta graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F05%3A00001009" target="_blank" >RIV/00216208:11320/05:00001009 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the computational complexity of partial covers of Theta graphs
Original language description
The paper considers the computational complexity of partial covers of Theta graphs
Czech name
O výpočetní složitosti částečných nakrytí Theta grafů
Czech description
V článku se zkoumá výpočetní složitost částečných nakrytí Theta grafů
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
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
Electronic Notes in Discrete Mathematics
ISSN
1571-0653
e-ISSN
—
Volume of the periodical
19
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
79-85
UT code for WoS article
—
EID of the result in the Scopus database
—