Spanning paths in hypercubes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F05%3A00001396" target="_blank" >RIV/00216208:11320/05:00001396 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Spanning paths in hypercubes
Original language description
We study the existence of spanning vertex-disjoint paths with prescribed endvertices in hypercubes. We provide a solution of the problem in case the distances of each pair of endvertices are odd, suggest further generalization of this result and explorethe relationship to the problem of hamiltonicity of hypercubes with faulty vertices.
Czech name
Cesty v hyperkrychlích
Czech description
V článku je zkoumán problém existence vrcholově disjunktních cest se zadanými koncovými vrcholy, které pokryjí všechny vrcholy n-rozměrné hyperkrychle a jeho souvislost s klasickým problémem existence hamiltonovských cyklů v hyperkrychli s vadnými vrcholy.
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/1ET100300517" target="_blank" >1ET100300517: Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing</a><br>
Continuities
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
Discrete Mathematics and Theoretical Computer Science
ISSN
1365-8050
e-ISSN
—
Volume of the periodical
AE
Issue of the periodical within the volume
1
Country of publishing house
FR - FRANCE
Number of pages
6
Pages from-to
363-368
UT code for WoS article
—
EID of the result in the Scopus database
—