Complexity of hypergraph coloring and Seidel's switching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F03%3A00002033" target="_blank" >RIV/00216208:11320/03:00002033 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Complexity of hypergraph coloring and Seidel's switching
Original language description
It is proved that deciding if a given graph is switchig equivalent to a regular graph is NP-complete. The proof is based on a variant of regular hypergraph bicoloring problem.
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/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young 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
2003
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
Graph Theoretic Concepts in Computer Science
ISBN
3-540-20452-0
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
297-308
Publisher name
Springer
Place of publication
Berlin
Event location
Berlin
Event date
Jan 1, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—