Standard

2-Factors Without Close Edges in the n-Dimensional Cube. / Bykov, I. S.

In: Journal of Applied and Industrial Mathematics, Vol. 13, No. 3, 01.07.2019, p. 405-417.

Research output: Contribution to journal › Article › peer-review

Harvard

Bykov, IS 2019, '2-Factors Without Close Edges in the n-Dimensional Cube', Journal of Applied and Industrial Mathematics, vol. 13, no. 3, pp. 405-417. https://doi.org/10.1134/S1990478919030037

APA

Bykov, I. S. (2019). 2-Factors Without Close Edges in the n-Dimensional Cube. Journal of Applied and Industrial Mathematics, 13(3), 405-417. https://doi.org/10.1134/S1990478919030037

Vancouver

Bykov IS. 2-Factors Without Close Edges in the n-Dimensional Cube. Journal of Applied and Industrial Mathematics. 2019 Jul 1;13(3):405-417. doi: 10.1134/S1990478919030037

Author

Bykov, I. S. / 2-Factors Without Close Edges in the n-Dimensional Cube. In: Journal of Applied and Industrial Mathematics. 2019 ; Vol. 13, No. 3. pp. 405-417.

BibTeX

@article{75079823e85a4c9180c26578f5e681d0,
title = "2-Factors Without Close Edges in the n-Dimensional Cube",
abstract = "—We say that two edges in the hypercube are close if their endpoints form a 2-dimensional subcube. We consider the problem of constructing a 2-factor not containing close edges in the hypercube graph. For solving this problem,we use the new construction for building 2-factors which generalizes the previously known stream construction for Hamiltonian cycles in a hypercube.Owing to this construction, we create a family of 2-factors without close edges in cubes of all dimensions starting from 10, where the length of the cycles in the obtained 2-factors grows together with the dimension.",
keywords = "2-factor, n-dimensional hypercube, perfect matching",
author = "Bykov, {I. S.}",
year = "2019",
month = jul,
day = "1",
doi = "10.1134/S1990478919030037",
language = "English",
volume = "13",
pages = "405--417",
journal = "Journal of Applied and Industrial Mathematics",
issn = "1990-4789",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "3",

}

RIS

TY - JOUR

T1 - 2-Factors Without Close Edges in the n-Dimensional Cube

AU - Bykov, I. S.

PY - 2019/7/1

Y1 - 2019/7/1

N2 - —We say that two edges in the hypercube are close if their endpoints form a 2-dimensional subcube. We consider the problem of constructing a 2-factor not containing close edges in the hypercube graph. For solving this problem,we use the new construction for building 2-factors which generalizes the previously known stream construction for Hamiltonian cycles in a hypercube.Owing to this construction, we create a family of 2-factors without close edges in cubes of all dimensions starting from 10, where the length of the cycles in the obtained 2-factors grows together with the dimension.

AB - —We say that two edges in the hypercube are close if their endpoints form a 2-dimensional subcube. We consider the problem of constructing a 2-factor not containing close edges in the hypercube graph. For solving this problem,we use the new construction for building 2-factors which generalizes the previously known stream construction for Hamiltonian cycles in a hypercube.Owing to this construction, we create a family of 2-factors without close edges in cubes of all dimensions starting from 10, where the length of the cycles in the obtained 2-factors grows together with the dimension.

KW - 2-factor

KW - n-dimensional hypercube

KW - perfect matching

UR - http://www.scopus.com/inward/record.url?scp=85071643831&partnerID=8YFLogxK

U2 - 10.1134/S1990478919030037

DO - 10.1134/S1990478919030037

M3 - Article

AN - SCOPUS:85071643831

VL - 13

SP - 405

EP - 417

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 3

ER -

ID: 21472006