The Subchromatic Index of Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00004616" target="_blank" >RIV/00216208:11320/07:00004616 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The Subchromatic Index of Graphs
Original language description
We show that recognizing graphs of subchromatic index 2 or 3 is NP-complete. Also a polynomial-time algorithm for graphs of bounded treewidth is given.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
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
2007
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
Tatra Mountains Mathematical Publications
ISBN
—
ISSN
1210-3195
e-ISSN
—
Number of pages
18
Pages from-to
—
Publisher name
Mathematical Institute of the Slovak Academy of Sciences
Place of publication
Bratislava
Event location
Vysne Ruzbachy
Event date
May 23, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000254030900010