D. S. Malyshev. A complete complexity dichotomy for the edge 3-colorability problem and a single 9-edge forbidden subgraph. // Optimization Letters. – 2026. – DOI: 10.1007/s11590-026-02335-4. – URL: https://doi.org/10.1007/s11590-026-02335-4
D. S. Malyshev (2026). A complete complexity dichotomy for the edge 3-colorability problem and a single 9-edge forbidden subgraph. Optimization Letters. https://doi.org/10.1007/s11590-026-02335-4
D. S. Malyshev. “A complete complexity dichotomy for the edge 3-colorability problem and a single 9-edge forbidden subgraph.” Optimization Letters, 2026. doi:10.1007/s11590-026-02335-4.
@article{Malyshev2026,
title = {A complete complexity dichotomy for the edge 3-colorability problem and a single 9-edge forbidden subgraph},
author = {Malyshev, D. S.},
journal = {Optimization Letters},
year = {2026},
doi = {10.1007/s11590-026-02335-4},
url = {https://doi.org/10.1007/s11590-026-02335-4}
}