A. V. Smirnov. NP-Completeness of the Eulerian Walk Problem for a Multiple Graph. // Automatic Control and Computer Sciences. – 2024. – DOI: 10.3103/s0146411624700470. – URL: https://doi.org/10.3103/s0146411624700470
A. V. Smirnov (2024). NP-Completeness of the Eulerian Walk Problem for a Multiple Graph. Automatic Control and Computer Sciences. https://doi.org/10.3103/s0146411624700470
A. V. Smirnov. “NP-Completeness of the Eulerian Walk Problem for a Multiple Graph.” Automatic Control and Computer Sciences, 2024. doi:10.3103/s0146411624700470.
@article{Smirnov2024,
title = {NP-Completeness of the Eulerian Walk Problem for a Multiple Graph},
author = {Smirnov, A. V.},
journal = {Automatic Control and Computer Sciences},
year = {2024},
doi = {10.3103/s0146411624700470},
url = {https://doi.org/10.3103/s0146411624700470}
}