Complexity of Compatible Decomposition of Eulerian Graphs and Their Transformations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003988" target="_blank" >RIV/00216208:11320/02:00003988 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Complexity of Compatible Decomposition of Eulerian Graphs and Their Transformations
Original language description
Some earlier defined local transformations between eulerian trails are generalized into transformations between decompositions of graphs into (possibly more) closed subtrails.
Czech name
—
Czech description
—
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
<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
2002
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
Lecture Notes In Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
2002
Issue of the periodical within the volume
2461
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
711-722
UT code for WoS article
—
EID of the result in the Scopus database
—