Kecai Deng, Hongyuan Qiu. Every graph is uniform-span (2,2)-choosable: Beyond the 1-2 conjecture. // Journal of Combinatorial Theory, Series B. – 2027. – DOI: 10.1016/j.jctb.2026.09.008. – URL: https://doi.org/10.1016/j.jctb.2026.09.008
Kecai Deng & Hongyuan Qiu (2027). Every graph is uniform-span (2,2)-choosable: Beyond the 1-2 conjecture. Journal of Combinatorial Theory, Series B. https://doi.org/10.1016/j.jctb.2026.09.008
Kecai Deng and Hongyuan Qiu. “Every graph is uniform-span (2,2)-choosable: Beyond the 1-2 conjecture.” Journal of Combinatorial Theory, Series B, 2027. doi:10.1016/j.jctb.2026.09.008.
@article{Deng2027,
title = {Every graph is uniform-span (2,2)-choosable: Beyond the 1-2 conjecture},
author = {Deng, Kecai and Qiu, Hongyuan},
journal = {Journal of Combinatorial Theory, Series B},
year = {2027},
doi = {10.1016/j.jctb.2026.09.008},
url = {https://doi.org/10.1016/j.jctb.2026.09.008}
}